Search
Now showing items 1-2 of 2
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.
On the difference of coefficients of univalent functions
(Faculty of Sciences and Mathematics, University of Niš, Serbia, 2021)