Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1314
DC FieldValueLanguage
dc.contributor.authorBožin, Vladimiren_US
dc.contributor.authorLazarević, Ivanen_US
dc.date.accessioned2024-07-10T12:32:56Z-
dc.date.available2024-07-10T12:32:56Z-
dc.date.issued2023-01-01-
dc.identifier.issn03545180-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1314-
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.publisherNiš : Prirodno-matematički fakulteten_US
dc.relation.ispartofFilomaten_US
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.subjectCSP problemen_US
dc.subjectundirected graphen_US
dc.titleH-coloring revisiteden_US
dc.typeArticleen_US
dc.identifier.doi10.2298/FIL2326747B-
dc.identifier.scopus2-s2.0-85168124238-
dc.identifier.isi001050591200001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85168124238-
dc.contributor.affiliationReal and Complex Analysisen_US
dc.relation.issn0354-5180en_US
dc.description.rankM22en_US
dc.relation.firstpage8747en_US
dc.relation.lastpage8754en_US
dc.relation.volume37en_US
dc.relation.issue26en_US
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairetypeArticle-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptReal and Complex Analysis-
crisitem.author.orcid0009-0001-3845-453X-
Appears in Collections:Research outputs
Files in This Item:
File Description SizeFormat
0354-51802326747B.pdf234.94 kBAdobe PDF
View/Open
Show simple item record

Page view(s)

15
checked on Nov 14, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons