A reduction procedure for coloring perfect \(K_ 4\)-free graphs

DOI10.1016/0095-8956(87)90019-0zbMath0634.05028OpenAlexW2029890572MaRDI QIDQ1096639

Alan C. Tucker

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90019-0

zbMATH Keywords

colouring algorithmK\({}_ 4\)-free graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (7)

Coloring perfect degenerate graphs ⋮ On weakly diamond-free Berge graphs ⋮ An algorithm for coloring some perfect graphs ⋮ 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. ⋮ Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs ⋮ On the quasi-locally paw-free graphs ⋮ On Tucker vertices of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• Star-cutsets and perfect graphs
• Coloring graphs with stable cutsets
• Critical perfect graphs and perfect 3-chromatic graphs
• Uniquely colorable perfect graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Coloring a Family of Circular Arcs
• Perfect zero–one matrices
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: A reduction procedure for coloring perfect \(K_ 4\)-free graphs