The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A polyhedron M n which is the convex hull of a set of characteristic vectors for all cubic subgraphs of the complete graph G n is studied. It is shown that the problem of vertices nonadjacency recognition for this polyhedron is NP-complete and the density of its polyhedral graph is exponential on n. Such a set of properties combines the polyhedron M n with the known polyhedron of Hamiltonian cycles.