Coloring planar perfect graphs by decomposition

DOI10.1007/BF02579263zbMath0629.05034OpenAlexW2065732258MaRDI QIDQ1093649

B. George

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579263

zbMATH Keywords

colouring algorithmdecomposition schemecolouring perfect graphsperfect planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

On planar perfectly contractile graphs ⋮ Colouring perfect planar graphs in parallel ⋮ Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs ⋮ Decomposition of perfect graphs

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• An O(N2) algorithm for coloring perfect planar graphs
• The Strong Perfect Graph Conjecture for Planar Graphs
• Unnamed Item