New classes of Berge perfect graphs

DOI10.1016/0012-365X(94)90373-5zbMath0807.05058OpenAlexW2068477628MaRDI QIDQ1332433

Caterina De Simone, Anna Galluccio

Publication date: 28 February 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90373-5

zbMATH Keywords

perfect graphschairBerge graphsimperfect graphreducible cliquestar-cutset lemma

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs ⋮ Chair-free Berge graphs are perfect ⋮ On the closure of graphs under substitution ⋮ Some properties of minimal imperfect graphs ⋮ On minimal imperfect graphs without induced \(P_5\)

Cites Work

• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• No antitwins in minimal imperfect graphs
• 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
• On the vertex packing problem
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• On the strong perfect graph conjecture

This page was built for publication: New classes of Berge perfect graphs