\(t\)-sails and sparse hereditary classes of unbounded tree-width
From MaRDI portal
Publication:6612294
DOI10.1016/j.ejc.2024.104005zbMATH Open1548.05083MaRDI QIDQ6612294
Publication date: 30 September 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal classes of graphs of unbounded clique-width
- Graph minors. XX: Wagner's conjecture
- Graph minors. V. Excluding a planar graph
- Upper bounds to the clique width of graphs
- On the tree-width of even-hole-free graphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Tree-width dichotomy
- Handle-rewriting hypergraph grammars
- Infinitely many minimal classes of graphs of unbounded clique-width
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Grid induced minor theorem for graphs of small degree
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- Graph Theory
- Graph minors. II. Algorithmic aspects of tree-width
- On the Block Number of Graphs
- Decomposition of Finite Graphs Into Forests
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
- Treewidth, Circle Graphs, and Circular Drawings
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
This page was built for publication: \(t\)-sails and sparse hereditary classes of unbounded tree-width
