Induced subgraphs and tree decompositions V. one neighbor in a hole

DOI10.1002/jgt.23055arXiv2205.04420MaRDI QIDQ6199380

Sophie Spirkl, Tara Abrishami, Maria Chudnovsky, Bogdan Alecu, Kristina Vušković, Sepehr Hajebi

Publication date: 23 February 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.04420

zbMATH Keywords

treewidthtree decompositioninduced subgraph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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
• Graph minors. XVI: Excluding a non-planar graph
• On the tree-width of even-hole-free graphs
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
• Grid induced minor theorem for graphs of small degree
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Parameters Tied to Treewidth
• Graph minors. II. Algorithmic aspects of tree-width
• Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
• Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs

This page was built for publication: Induced subgraphs and tree decompositions V. one neighbor in a hole