Coloring perfect degenerate graphs

DOI10.1016/S0012-365X(96)00009-XzbMath0870.05020MaRDI QIDQ1356545

Frédéric Maffray, Hacène Ait Haddadene

Publication date: 15 September 1997

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

zbMATH Keywords

coloringpolynomial timecombinatorial algorithmdegenerate Berge graphdegenerate perfect graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On weakly diamond-free Berge graphs ⋮ Classes of perfect graphs ⋮ On the quasi-locally paw-free graphs ⋮ On Tucker vertices of graphs

Cites Work

• On rigid circuit graphs
• Topics on perfect graphs
• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• The splittance of a graph
• Split-neighbourhood graphs and the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring perfect degenerate graphs