Well-quasi-ordering versus clique-width
From MaRDI portal
Publication:1745730
DOI10.1016/j.jctb.2017.09.012zbMath1384.05114OpenAlexW2762850984MaRDI QIDQ1745730
Igor Razgon, Vadim V. Lozin, Victor Zamaraev
Publication date: 18 April 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/93088/7/WRAP-well-quasi-ordering-versus-clique-width-Lozin-2017.pdf
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Labelled well-quasi-order for permutation classes ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ A class of graphs with large rankwidth ⋮ The Treewidth and Pathwidth of Graph Unions ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes
Cites Work
- 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
- Upper bounds to the clique width of graphs
- Two forbidden induced subgraphs and well-quasi-ordering
- Well-quasi-order for permutation graphs omitting a path and a clique
- Handle-rewriting hypergraph grammars
- A model-theoretic characterisation of clique width
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors. IV: Tree-width and well-quasi-ordering
- The relative clique-width of a graph
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- Bipartite induced subgraphs and well-quasi-ordering
- 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 versus clique-width
