How well can a graph be n-colored?
- 31 December 1981
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 34 (1) , 69-80
- https://doi.org/10.1016/0012-365x(81)90023-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Algorithm 477: Generator of set-partitions to exactly R subsets [G7]Communications of the ACM, 1974
- On the Fundamental Problem of MathematicsThe American Mathematical Monthly, 1972