Ordering without Forbidden Patterns

DOI10.1007/978-3-662-44777-2_46zbMath1425.05134arXiv1408.1461OpenAlexW1816145465MaRDI QIDQ2921442

Arash Rafiey, Bojan Mohar, Pavol Hell

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.1461

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

Oriented expressions of graph properties ⋮ Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs ⋮ Recognizing interval bigraphs by forbidden patterns ⋮ Unnamed Item ⋮ Strong Cocomparability Graphs and Slash-Free Orderings of Matrices ⋮ Min-Orderable Digraphs ⋮ Maximum induced matching algorithms via vertex ordering characterizations ⋮ Recognition and drawing of stick graphs ⋮ A vertex ordering characterization of simple-triangle graphs ⋮ On grounded \(\llcorner\)-graphs and their relatives ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Describing hereditary properties by forbidden circular orderings ⋮ Maximum Induced Matching Algorithms via Vertex Ordering Characterizations

This page was built for publication: Ordering without Forbidden Patterns