Well-quasi-ordering Does Not Imply Bounded Clique-width

DOI10.1007/978-3-662-53174-7_25zbMath1417.05155arXiv1503.00571OpenAlexW52229496MaRDI QIDQ2827822

Igor Razgon, Victor Zamaraev, Vadim V. Lozin

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Infinitely many minimal classes of graphs of unbounded clique-width ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Well-quasi-ordering versus clique-width ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes

Cites Work

• Unnamed Item
• Well-quasi-order of relabel functions
• Graph minors. XX: Wagner's conjecture
• Letter graphs and well-quasi-order by induced subgraphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Two forbidden induced subgraphs and well-quasi-ordering
• The theory of well-quasi-ordering: a frequently discovered concept
• On the relationship between NLC-width and linear NLC-width
• The relative clique-width of a graph
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• Well-structured transition systems everywhere!

This page was built for publication: Well-quasi-ordering Does Not Imply Bounded Clique-width