Infinitely many minimal classes of graphs of unbounded clique-width
From MaRDI portal
Publication:2413975
DOI10.1016/j.dam.2017.02.012zbMath1395.05051arXiv1701.08857MaRDI QIDQ2413975
Nicholas Korpelainen, Jan Foniok, Vadim V. Lozin, Andrew J. Collins, Victor Zamaraev
Publication date: 17 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08857
Related Items
A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width, The grid theorem for vertex-minors, Uncountably many minimal hereditary classes of graphs of unbounded clique-width, Between clique-width and linear clique-width of bipartite graphs, Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
Cites Work
- Well-quasi-order of relabel functions
- Minimal classes of graphs of unbounded clique-width
- Graph minors. XX: Wagner's conjecture
- On canonical antichains
- Graph minors. V. Excluding a planar graph
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- Linear Clique‐Width for Hereditary Classes of Cographs
- Unnamed Item