×

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. (English) Zbl 0448.05030


MSC:

05C15 Coloring of graphs and hypergraphs
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Dailey, D.P., Graph coloring by humans and machines, ()
[2] Cook, S.A., The complexity of theorem-proving procedures, () · Zbl 0363.68125
[3] Karp, R.M., Reducibility among combinatorial problems, () · Zbl 0366.68041
[4] Garey, M.R.; Johnson, D.S.; Stockmeyer, L., Some simplified NP-complete graph problems, Theoretical computer science, 1, 237-267, (1976) · Zbl 0338.05120
[5] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, MA, Chapter 10 · Zbl 0286.68029
[6] Garey, M.R.; Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman San Francisco · Zbl 0411.68039
[7] Stockmeyer, L., Planar 3-colorability is polynomial complete, SIGACT news, 19-25, (1973)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.