Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1314| Title: | H-coloring revisited | Authors: | Božin, Vladimir Lazarević, Ivan |
Affiliations: | Real and Complex Analysis | Keywords: | CSP problem;undirected graph | Issue Date: | 1-Jan-2023 | Rank: | M22 | Publisher: | Niš : Prirodno-matematički fakultet | Journal: | Filomat | 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1314 | ISSN: | 03545180 | DOI: | 10.2298/FIL2326747B | Rights: | Attribution 3.0 United States |
| Appears in Collections: | Research outputs |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 0354-51802326747B.pdf | 234.94 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
