Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

DOI10.1016/j.dam.2021.02.007zbMath1460.05161arXiv1503.01628OpenAlexW3133901838MaRDI QIDQ2661217

Juraj Stacho, Aistis Atminas, Robert Brignall, Vadim V. Lozin

Publication date: 1 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

well-quasi-orderingclique-widthhereditary classrank-widthuniversal graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Uncountably many minimal hereditary classes of graphs of unbounded clique-width ⋮ A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width ⋮ A counterexample regarding labelled well-quasi-ordering

Cites Work

• Unnamed Item
• Well-quasi-order of relabel functions
• Minimal classes of graphs of unbounded clique-width
• Graph minors. XX: Wagner's conjecture
• Boolean-width of graphs
• Graph minors. III. Planar tree-width
• Labelled induced subgraphs and well-quasi-ordering
• Bichain graphs: geometric model and universal graphs
• Recent developments on graphs of bounded clique-width
• On canonical antichains
• Graph operations characterizing rank-width
• Graph minors. I. Excluding a forest
• Split graphs of Dilworth number 2
• Letter graphs and well-quasi-order by induced subgraphs
• Well-quasi-ordering versus clique-width
• Generating and enumerating 321-avoiding and skew-merged simple permutations
• Linear time solvable optimization problems on graphs of bounded clique-width
• Infinitely many minimal classes of graphs of unbounded clique-width
• Approximating clique-width and branch-width
• The theory of well-quasi-ordering: a frequently discovered concept
• Rank-width and vertex-minors
• The plane-width of graphs
• Clique-width for hereditary graph classes
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Induced subgraphs and well‐quasi‐ordering

This page was built for publication: Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs