Претраживање
Приказ резултата 1-1 од 1
H-colouring revisited
(Faculty of Sciences and Mathematics, Department of Mathematics, 2023)
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.