David P. Dailey
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
1980/01/01 by David P. Dailey · 5 citations
Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Graph Labeling and Dimension Problems