t-sails and sparse hereditary classes of unbounded tree-width

DOI10.1016/J.EJC.2024.104005MaRDI QIDQ6612294zbMATH OpenFDO

Authors Danny Cocks

Publication date 30 September 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104005

zbMATH Keywords

sparse hereditary path-star graph classes

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tree-width dichotomy
• Infinitely many minimal classes of graphs of unbounded clique-width
• The structure of obstructions to treewidth and pathwidth
• scientific article; zbMATH DE number 4210186
• scientific article; zbMATH DE number 1696534

Cites work

• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
• A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
• Decomposition of Finite Graphs Into Forests
• Graph minors. II. Algorithmic aspects of tree-width
• Graph minors. V. Excluding a planar graph
• Graph minors. XX: Wagner's conjecture
• Graph theory
• Grid induced minor theorem for graphs of small degree
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 1696534 (Why is no real title available?)
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
• Infinitely many minimal classes of graphs of unbounded clique-width
• Minimal classes of graphs of unbounded clique-width
• Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
• MSO undecidability for hereditary classes of unbounded clique width
• On the block number of graphs
• On the tree-width of even-hole-free graphs
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
• Tree-width dichotomy
• Treewidth, Circle Graphs, and Circular Drawings
• Uncountably many minimal hereditary classes of graphs of unbounded clique-width
• Upper bounds to the clique width of graphs
• Well-quasi-ordering does not imply bounded clique-width

This page was built for publication: \(t\)-sails and sparse hereditary classes of unbounded tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612294)