Polynomial graph-colorings
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 108-119
- https://doi.org/10.1007/bfb0028977
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988
- On the complexity of the general coloring problemInformation and Control, 1981
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981
- Representations of graphs by means of products and their complexityLecture Notes in Computer Science, 1981