Complexity of dimension three and some related edge-covering characteristics of graphs

This publication has 7 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
  Discrete Mathematics, 1978
• The Complexity of Near-Optimal Graph Coloring
  Journal of the ACM, 1976
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• Planar 3-colorability is polynomial complete
  ACM SIGACT News, 1973
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Partially Ordered Sets
  American Journal of Mathematics, 1941