,
Simon D. Fink
,
Alexander Firbas
,
Robert Ganian
,
Martin Nöllenburg
,
Marie Diana Sieper
Creative Commons Attribution 4.0 International license
In this paper, we study the Pattern Avoidance problem of determining whether a given graph G admits a linear vertex order which avoids a given pattern P, i.e., a vertex sequence with some forced and forbidden edges, on every suborder. Such patterns form a natural ordered counterpart to induced subgraphs in the order-invariant setting, and it is known that Pattern Avoidance captures a broad variety of graph problems including Bandwidth, Vertex Coloring, Queue Number, and extends to vertex-deletion problems such as Odd Cycle Transversal. We show that Pattern Avoidance is Σ_2^P-complete and furthermore remains intractable (in both the classical and parameterized sense) even under a variety of severe restrictions to both the pattern P and the graph G. As our main contributions, we complement these lower bounds with the following tractability results, which provide a unifying framework for recognizing pattern-definable graph classes: - a fixed-parameter algorithm w.r.t. the vertex integrity of G plus |V(P)|, - a fixed-parameter algorithm w.r.t. the neighborhood diversity of G plus |E(P)|, and - a polynomial algorithm for Pattern Avoidance on forests for almost all constant-sized patterns.
@InProceedings{depian_et_al:LIPIcs.IPEC.2026.26,
author = {Depian, Thomas and Fink, Simon D. and Firbas, Alexander and Ganian, Robert and N\"{o}llenburg, Martin and Sieper, Marie Diana},
title = {{The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.26},
URN = {urn:nbn:de:0030-drops-281996},
doi = {10.4230/LIPIcs.IPEC.2026.26},
annote = {Keywords: vertex ordering, forbidden patterns, parameterized algorithms, polynomial hierarchy}
}