Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
DOI10.1016/j.jctb.2023.10.008arXiv2212.02737MaRDI QIDQ6144407
Tara Abrishami, Sepehr Hajebi, Bogdan Alecu, Sophie Spirkl, Maria Chudnovsky
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.02737
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Safe separators for treewidth
- Graph minors. V. Excluding a planar graph
- A note on Ramsey numbers
- On the tree-width of even-hole-free graphs
- Tree-width dichotomy
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Grid induced minor theorem for graphs of small degree
- Graph minors. II. Algorithmic aspects of tree-width
- On the Block Number of Graphs
- A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
This page was built for publication: Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
