Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
- 31 December 1984
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 50, 171-177
- https://doi.org/10.1016/0012-365x(84)90046-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Recursive Colorings of GraphsCanadian Journal of Mathematics, 1980
- A SURVEY OF NONCOMPLETE RAMSEY THEORY FOR GRAPHSAnnals of the New York Academy of Sciences, 1979
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973
- The undecidability of the domino problemMemoirs of the American Mathematical Society, 1966