Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

@article{Dailey1980UniquenessOC,
  title={Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete},
  author={David P. Dailey},
  journal={Discrete Mathematics},
  year={1980},
  volume={30},
  pages={289-293}
}
The study of the computational complexity of various applied and theoretical problems has become of interest to researchers in a wariety of fields outside pure mathematics in recent years. In part, this is due to the widespread recurrence of a particular class of problems known as NP-complete. Such traditional problems as deciding statements of propositional calculus [2] and graph coloring [3] haw~ been shown to belong to this class as well as various applied problems in such diverse areas as… CONTINUE READING

References

Publications referenced by this paper.

Graph coloring by humans and machines, Ph.D. Thesis

  • D. P. Dailey
  • Third Annual A('M Computing Tt, eory Symposium,
  • 1971
1 Excerpt

Similar Papers

Loading similar papers…