Geodesic
H-coloring revisited
Filomat, Tome 37 (2023) no. 26, p. 8747

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

DOI

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.
DOI : 10.2298/FIL2326747B
Classification : 05C60, 05C15
Keywords: CSP problem, undirected graph 
Vladimir Božin; Ivan Lazarević. H-coloring revisited. Filomat, Tome 37 (2023) no. 26, p. 8747 . doi: 10.2298/FIL2326747B
@article{10_2298_FIL2326747B,
     author = {Vladimir Bo\v{z}in and Ivan Lazarevi\'c},
     title = {H-coloring revisited},
     journal = {Filomat},
     pages = {8747 },
     year = {2023},
     volume = {37},
     number = {26},
     doi = {10.2298/FIL2326747B},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2326747B/}
}
TY  - JOUR
AU  - Vladimir Božin
AU  - Ivan Lazarević
TI  - H-coloring revisited
JO  - Filomat
PY  - 2023
SP  - 8747 
VL  - 37
IS  - 26
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL2326747B/
DO  - 10.2298/FIL2326747B
LA  - en
ID  - 10_2298_FIL2326747B
ER  - 
%0 Journal Article
%A Vladimir Božin
%A Ivan Lazarević
%T H-coloring revisited
%J Filomat
%D 2023
%P 8747 
%V 37
%N 26
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL2326747B/
%R 10.2298/FIL2326747B
%G en
%F 10_2298_FIL2326747B

Cité par Sources :