Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
From MaRDI portal
Publication:2819509
DOI10.1007/978-3-319-44543-4_20zbMath1482.05281OpenAlexW2513651378MaRDI QIDQ2819509
Daniël Paulusma, Konrad K. Dabrowski, Vadim V. Lozin
Publication date: 29 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/88456/7/WRAP-well-quasi-ordering-versus-clique-Lozin-2017.pdf
Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Recent Progress on Well-Quasi-ordering Graphs ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Unnamed Item
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 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
- Well-structured transition systems everywhere!
This page was built for publication: Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
