dc.creator | Božin, Vladimir | |
dc.creator | Lazarević, Ivan | |
dc.date.accessioned | 2024-04-03T10:57:20Z | |
dc.date.available | 2024-04-03T10:57:20Z | |
dc.date.issued | 2023 | |
dc.identifier.uri | https://grafar.grf.bg.ac.rs/handle/123456789/3485 | |
dc.description.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. | sr |
dc.language.iso | en | sr |
dc.publisher | Faculty of Sciences and Mathematics, Department of Mathematics | sr |
dc.rights | openAccess | sr |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.source | Filomat | sr |
dc.subject | H-colouring undirected graph | sr |
dc.subject | CSP | sr |
dc.title | H-colouring revisited | sr |
dc.type | article | sr |
dc.rights.license | BY-NC-ND | sr |
dc.citation.epage | 8754 | |
dc.citation.spage | 8747 | |
dc.identifier.doi | 10.2298/FIL2326747B | |
dc.identifier.fulltext | http://grafar.grf.bg.ac.rs/bitstream/id/12954/bitstream_12954.pdf | |
dc.type.version | publishedVersion | sr |