Uncountably many minimal hereditary classes of graphs of unbounded clique-width
From MaRDI portal
Publication:2121810
DOI10.37236/10483zbMath1486.05258arXiv2104.00412OpenAlexW3147940042WikidataQ113202461 ScholiaQ113202461MaRDI QIDQ2121810
Robert Brignall, Daniel G. Cocks
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.00412
Combinatorics on words (68R15) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A new graph construction of unbounded clique-width
- Minimal classes of graphs of unbounded clique-width
- Substitutions in dynamics, arithmetics and combinatorics
- 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
- The grid theorem for vertex-minors
- Handle-rewriting hypergraph grammars
- Infinitely many minimal classes of graphs of unbounded clique-width
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Graph Theory
- Clique-width for hereditary graph classes
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES