Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete

This publication has 8 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
  SIAM Journal on Algebraic Discrete Methods, 1986
• The complexity of facets (and some facets of complexity)
  Journal of Computer and System Sciences, 1984
• On the unique satisfiability problem
  Information and Control, 1982
• Every planar map is four colorable. Part I: Discharging
  Illinois Journal of Mathematics, 1977
• Planar 3-colorability is polynomial complete
  ACM SIGACT News, 1973
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941