The strong perfect graph conjecture for pan-free graphs

DOI10.1016/0095-8956(89)90019-1zbMath0661.05057OpenAlexW2047069830MaRDI QIDQ1112848

Stephan Olariu

Publication date: 1989

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

Full work available at URL: https://digitalcommons.odu.edu/cgi/viewcontent.cgi?article=1109&context=computerscience_fac_pubs

zbMATH Keywords

chromatic numberclique numberclaw-free graphsStrong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ On independent vertex sets in subclasses of apple-free graphs ⋮ Claw-free graphs---a survey ⋮ Chair-free Berge graphs are perfect ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ On the structure of (pan, even hole)‐free graphs ⋮ An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs ⋮ Decomposition techniques applied to the clique-stable set separation problem ⋮ On minimal imperfect graphs without induced \(P_5\)

Cites Work

• Unnamed Item
• Star-cutsets and perfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• Normal hypergraphs and the perfect graph conjecture