Even-hole-free graphs still have bisimplicial vertices

DOI10.1016/j.jctb.2023.02.009zbMath1512.05298arXiv1909.10967OpenAlexW2975372345MaRDI QIDQ6038593

P. D. Seymour, Maria Chudnovsky

Publication date: 2 May 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

induced subgrapheven-hole-free graphbisimplicial vertex

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ Hitting all maximum stable sets in \(P_5\)-free graphs ⋮ Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes

Cites Work

• Bisimplicial vertices in even-hole-free graphs
• Even-hole-free graphs part I: Decomposition theorem
• Even-hole-free graphs: A survey
• Unnamed Item

This page was built for publication: Even-hole-free graphs still have bisimplicial vertices