Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete.
David P. DaileyPublished in: Discret. Math. (1980)
Keyphrases
- np complete
- phase transition
- polynomial time complexity
- random graphs
- satisfiability problem
- randomly generated
- bounded treewidth
- np hard
- constraint satisfaction problems
- np complete problems
- constraint satisfaction
- planar graphs
- pspace complete
- computational complexity
- graph theoretic
- graph matching
- graph coloring
- conjunctive queries
- graph representation
- complex structures
- data complexity
- graph model
- graph structures
- directed graph
- scheduling problem
- database