An O(N2) algorithm for coloring perfect planar graphs

DOI10.1016/0196-6774(84)90040-3zbMath0538.05036OpenAlexW2058660326MaRDI QIDQ3323978

Donna M. Wilson, Alan C. Tucker

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90040-3

zbMATH Keywords

chromatic numberperfect planar graphsmaximal clique size

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Coloring planar perfect graphs by decomposition ⋮ Colouring perfect planar graphs in parallel ⋮ Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs ⋮ An algorithm for colouring perfect planar graphs

This page was built for publication: An O(N2) algorithm for coloring perfect planar graphs