An O(N2) algorithm for coloring perfect planar graphs
- 31 March 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (1), 60-68
- https://doi.org/10.1016/0196-6774(84)90040-3
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Critical perfect graphs and perfect 3-chromatic graphsJournal of Combinatorial Theory, Series B, 1977
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Perfect Graphs and an Application to Optimizing Municipal ServicesSIAM Review, 1973
- The Strong Perfect Graph Conjecture for Planar GraphsCanadian Journal of Mathematics, 1973
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972