Coloring planar perfect graphs by decomposition
- 1 December 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (4) , 381-385
- https://doi.org/10.1007/bf02579263
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Decomposition of perfect graphsJournal of Combinatorial Theory, Series B, 1987
- Recognizing planar perfect graphsJournal of the ACM, 1987
- An O(N2) algorithm for coloring perfect planar graphsJournal of Algorithms, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- The Strong Perfect Graph Conjecture for Planar GraphsCanadian Journal of Mathematics, 1973