H-coloring revisited
Abstract
In this paper we give a new, shortened proof of NP-completeness of CSP problem for
undirected, non bipartite graphs, of interest for generalization to QCSP problem. We also give some
illustrative examples.
Refbacks
- There are currently no refbacks.