Murky graphs

DOI10.1016/0095-8956(90)90028-XzbMath0643.05054OpenAlexW2912489228MaRDI QIDQ1101470

Ryan B. Hayward

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90028-x

zbMATH Keywords

perfect graphschordless cyclestar cutsetchordless pathmurky graphsunbreakable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (7)

Most unbreakable murky graphs are bull-free ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Locally perfect graphs ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Classes of perfect graphs ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ On the stable set problem in special \(P_{5}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Weakly triangulated graphs
• Star-cutsets and perfect graphs
• On sources in comparability graphs, with applications
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs

This page was built for publication: Murky graphs