Highly Influenced

# 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} }

- Published 1980 in Discrete Mathematics
DOI:10.1016/0012-365X(80)90236-8

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