Deciding 3-colourability in less than O(1.415n) steps
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 177-188
- https://doi.org/10.1007/3-540-57899-4_51
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1992
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971
- On cliques in graphsIsrael Journal of Mathematics, 1965