An algorithm for coloring some perfect graphs

DOI10.1016/S0012-365X(97)00082-4zbMath0895.05023MaRDI QIDQ1382811

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

Publication date: 14 September 1998

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

zbMATH Keywords

colouringchromatic numberperfect graphscolouring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On Tucker vertices of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• On weakly diamond-free Berge graphs
• The splittance of a graph
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs