Geodesic
Chromatic numbers of the strong product of odd cycles
Mathematica slovaca, Tome 56 (2006) no. 4, pp. 379-385
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C15 
@article{MASLO_2006_56_4_a1,
     author = {\v{Z}erovnik, Janez},
     title = {Chromatic numbers of the strong product of odd cycles},
     journal = {Mathematica slovaca},
     pages = {379--385},
     year = {2006},
     volume = {56},
     number = {4},
     mrnumber = {2267759},
     zbl = {1141.05035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_2006_56_4_a1/}
}
TY  - JOUR
AU  - Žerovnik, Janez
TI  - Chromatic numbers of the strong product of odd cycles
JO  - Mathematica slovaca
PY  - 2006
SP  - 379
EP  - 385
VL  - 56
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_2006_56_4_a1/
LA  - en
ID  - MASLO_2006_56_4_a1
ER  - 
%0 Journal Article
%A Žerovnik, Janez
%T Chromatic numbers of the strong product of odd cycles
%J Mathematica slovaca
%D 2006
%P 379-385
%V 56
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_2006_56_4_a1/
%G en
%F MASLO_2006_56_4_a1
Žerovnik, Janez. Chromatic numbers of the strong product of odd cycles. Mathematica slovaca, Tome 56 (2006) no. 4, pp. 379-385. http://geodesic.mathdoc.fr/item/MASLO_2006_56_4_a1/

[1] FEIGENBAUM J.-SCHÄFFER A.: Finding the prime factors of strong direct product graphs in polynomial time. Discrete Math. 109 (1992), 77-102. | MR | Zbl

[2] HELL P.-ROBERTS F.: Analogues of the Shannon capacity of graph. Ann. Discrete Math. 12 (1982), 155-168. | MR

[3] HELL P.-NEŠETŘIL J.: On the complexity of H-coloring. J. Combin. Theory Ser. B 48 (1990), 92-110. | MR | Zbl

[4] IMRICH W.-KLAVŽAR S.: Product Graphs: Structure and Recognition. John Wiley k. Sons, New York, 2000. | MR | Zbl

[5] JHA P. K.: Smallest independent dominating sets in Kronecker products of cycles. Discrete Appl. Math. (To appear). | MR | Zbl

[6] KLAVŽAR S.: Strong products of $\chi$-critical graphs. Aequationes Math. 45 (1993), 153-162. | MR | Zbl

[7] KLAVŽAR S.: Coloring graph products. A survey. Discrete Math. 155 (1996), 135-145. | MR | Zbl

[8] LOVÁSZ L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25 (1979), 1-7. | MR | Zbl

[9] PETFORD A.-WELSH D.: A randomised 3-colouring algorithm. Discrete Math. 74 (1989), 253-261. | MR | Zbl

[10] SABIDUSSI G.: Graph multiplication. Math. Z. 72 (1960), 446-457. | MR | Zbl

[11] SHANNON C. E.: The zero-error capacity of a noisy channel. IRE Trans. Inform. Theory 2 (1956), 8-19. | MR

[12] VESEL A.: The independence number of the strong product of cycles. Comput. Math. Appl. 36 (1998), 9-21. | MR | Zbl

[13] VESZTERGOMBI F.: Some remarks on the chromatic number of the strong product of graphs. Acta Cybernet. 4 (1978/79), 207-212. | MR

[14] ŽEROVNIK J.: A randomized algorithm for k-color ability. Discrete Math. 131 (1994), 379-393. | MR

[15] ŽEROVNIK J.: Pomen temperature pri nekaterih hevristikah kombinatorične optimizacije. In: Proceedings DSI, Portorož, april 2000, Slovensko Društvo Informatika Ljubljana 2000, pp. 604-609. (Slovene)