Odd Holes in Bull-Free Graphs

DOI10.1137/17M1131301zbMath1385.05042arXiv1704.04262OpenAlexW2963159653WikidataQ64384567 ScholiaQ64384567MaRDI QIDQ4638616

Vaidy Sivaraman, Maria Chudnovsky

Publication date: 27 April 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmbull-free graphodd hole

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On graphs with 2 trivial distance ideals ⋮ Unnamed Item ⋮ Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes ⋮ Distance ideals of graphs

Cites Work

• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The strong perfect graph theorem
• Recognizing Berge graphs
• Unnamed Item