\(t\)-sails and sparse hereditary classes of unbounded tree-width
type: Item
instance of: scholarly article
title: \(t\)-sails and sparse hereditary classes of unbounded tree-width
zbMATH Open document ID: 1548.05083
author: Danny Cocks
published in: European Journal of Combinatorics
publication date: 2024-09-30T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7920233
zbMATH Keywords: sparse hereditary path-star graph classes
MaRDI profile type: Publication
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph minors. V. Excluding a planar graph
cites work: On the tree-width of even-hole-free graphs
cites work: Grid induced minor theorem for graphs of small degree
cites work: (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
cites work: Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
cites work: Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
cites work: Graph Theory
cites work: Treewidth, Circle Graphs, and Circular Drawings
cites work: Graph minors. XX: Wagner's conjecture
cites work: Tree-width dichotomy
cites work: Minimal classes of graphs of unbounded clique-width
cites work: Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
cites work: Infinitely many minimal classes of graphs of unbounded clique-width
cites work: Q6124948
cites work: Uncountably many minimal hereditary classes of graphs of unbounded clique-width
cites work: A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
cites work: Decomposition of Finite Graphs Into Forests
cites work: Handle-rewriting hypergraph grammars
cites work: Upper bounds to the clique width of graphs
cites work: Q2766682
cites work: Well-quasi-ordering Does Not Imply Bounded Clique-width
cites work: Q5665234
cites work: On the Block Number of Graphs
DOI: 10.1016/J.EJC.2024.104005
description: scientific article; zbMATH DE number 7920233