Most unbreakable murky graphs are bull-free

DOI10.1007/BF02988303zbMath0779.05027OpenAlexW2035530125MaRDI QIDQ2366956

Alain Hertz

Publication date: 11 August 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988303

zbMATH Keywords

perfectbull-freechordless pathbull graphmurky graphunbreakable

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites Work

• Bull-free Berge graphs are perfect
• Murky graphs
• Star-cutsets and perfect graphs

This page was built for publication: Most unbreakable murky graphs are bull-free