On weakly diamond-free Berge graphs

DOI10.1016/0012-365X(96)00031-3zbMath0859.05045MaRDI QIDQ1126205

Sylvain Gravier, Hacène Ait Haddadene

Publication date: 8 December 1996

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

zbMATH Keywords

chromatic numberholestrong perfect graph conjecturediamondantiholeBerge graphclique size

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

An algorithm for coloring some perfect graphs ⋮ On Tucker vertices of graphs

Cites Work

• Unnamed Item
• Coloring perfect \((K_ 4\)-e)-free graphs
• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• Coloring perfect degenerate graphs