Polynomial graph-colorings
- 1 January 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 35 (1) , 29-45
- https://doi.org/10.1016/0166-218x(92)90294-k
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- On the complexity of the general coloring problemInformation and Control, 1981
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981