Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree
DOI10.1016/j.jctb.2023.10.005arXiv2108.01162OpenAlexW3196344216MaRDI QIDQ6144405
Paweł Rzążewski, Kristina Vušković, Cemil Dibek, Tara Abrishami, Sepehr Hajebi, 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/2108.01162
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Claw-free graphs. V. Global structure
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVI: Excluding a non-planar graph
- On the tree-width of even-hole-free graphs
- Tree-width dichotomy
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
- Towards tight(er) bounds for the excluded grid theorem
- Grid induced minor theorem for graphs of small degree
- Parameters Tied to Treewidth
- Parameterized Algorithms
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
This page was built for publication: Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree
