Well-quasi-ordering versus clique-width: new results on bigenic classes
From MaRDI portal
Publication:722586
DOI10.1007/s11083-017-9430-7zbMath1404.05179arXiv1611.03671OpenAlexW2733323637WikidataQ59614166 ScholiaQ59614166MaRDI QIDQ722586
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Publication date: 27 July 2018
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03671
Related Items (2)
Clique-Width for Graph Classes Closed under Complementation ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes
Cites Work
- Unnamed Item
- Well-quasi-order of relabel functions
- Graph minors. XX: Wagner's conjecture
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Labelled induced subgraphs and well-quasi-ordering
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Edge dominating set and colorings on graphs with fixed clique-width
- 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
- Clique-width and edge contraction
- Approximating clique-width and branch-width
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors. IV: Tree-width and well-quasi-ordering
- Bounding Clique-Width via Perfect Graphs
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Colouring Diamond-free Graphs.
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Well-structured transition systems everywhere!
This page was built for publication: Well-quasi-ordering versus clique-width: new results on bigenic classes
