Excluding Induced Subdivisions of the Bull and Related Graphs

DOI10.1002/jgt.20631zbMath1248.05156arXiv1309.1312OpenAlexW2137580483MaRDI QIDQ2911052

Irena Penev, Maria Chudnovsky, Nicolas Trotignon, Alexander D. Scott

Publication date: 12 September 2012

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

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

zbMATH Keywords

induced subgraphscoloringnecklacechi-boundedbull

Mathematics Subject Classification ID

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)

Related Items (2)

The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Amalgams and χ-Boundedness

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• The Erdős-Hajnal conjecture for bull-free graphs
• Paw-free graphs
• Induced cycles and chromatic number
• Normal hypergraphs and the perfect graph conjecture
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• A structure theorem for graphs with no cycle with a unique chord and its consequences

This page was built for publication: Excluding Induced Subdivisions of the Bull and Related Graphs