On the parameters of perfect 2-colorings of circulant graphs
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 82-89.

Voir la notice de l'article provenant de la source Math-Net.Ru

A construction that makes it possible to produce perfect 2-colorings with previously undiscovered parameters is proposed. Bibliogr. 18.
Keywords: perfect coloring, unbroken coloring.
Mots-clés : equitable partition, circulant graph
@article{DA_2011_18_6_a5,
     author = {D. B. Khoroshilova},
     title = {On the parameters of perfect 2-colorings of circulant graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {82--89},
     publisher = {mathdoc},
     volume = {18},
     number = {6},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_6_a5/}
}
TY  - JOUR
AU  - D. B. Khoroshilova
TI  - On the parameters of perfect 2-colorings of circulant graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 82
EP  - 89
VL  - 18
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_6_a5/
LA  - ru
ID  - DA_2011_18_6_a5
ER  - 
%0 Journal Article
%A D. B. Khoroshilova
%T On the parameters of perfect 2-colorings of circulant graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 82-89
%V 18
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_6_a5/
%G ru
%F DA_2011_18_6_a5
D. B. Khoroshilova. On the parameters of perfect 2-colorings of circulant graphs. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 82-89. http://geodesic.mathdoc.fr/item/DA_2011_18_6_a5/

[1] Avgustinovich S. V., Borodin O. V., Frid A. E., “Distributivnye raskraski ploskikh triangulyatsii minimalnoi stepeni 5”, Diskret. analiz i issled. operatsii. Ser. 1, 8:1 (2001), 3–16 | MR

[2] Vizing V. G., “Distributivnaya raskraska vershin grafa”, Diskret. analiz i issled. operatsii, 2:4 (1995), 3–12 | MR | Zbl

[3] Efremova E. M., Molodykh E. A., Parametry sovershennykh raskrasok beskonechnoi kubicheskoi reshëtki v dva tsveta, Ustnoe soobschenie

[4] Prasolov V. V., Zadachi i teoremy lineinoi algebry, Nauka, Fizmatlit, M., 1996, 304 pp. | Zbl

[5] Prasolov V. V., Mnogochleny, MTsNMO, M., 2001, 104–113

[6] Puzynina S. A., “Periodichnost sovershennykh raskrasok beskonechnoi pryamougolnoi reshëtki”, Diskret. analiz i issled. operatsii. Ser. 1, 11:1 (2004), 79–92 | MR | Zbl

[7] Puzynina S. A., “Sovershennye raskraski vershin grafa $G(\mathbb Z^2)$ v tri tsveta”, Diskret. analiz i issled. operatsii. Ser. 2, 12:1 (2005), 37–54 | MR

[8] Fon-Der-Flaass D. G., “Sovershennye 2-raskraski 12-mernogo kuba, dostigayuschie granitsy korrelyatsionnoi immunnosti”, Sib. elektron. mat. izv., 4 (2007), 292–295 | MR | Zbl

[9] Fon-Der-Flaass D. G., “Sovershennye 2-raskraski giperkuba”, Sib. mat. zhurn., 48:4 (2007), 923–930 | MR | Zbl

[10] Kharari F., Teoriya grafov, KomKniga, M., 2006, 296 pp.

[11] Khoroshilova D. B., “O tsirkulyarnykh sovershennykh raskraskakh v dva tsveta”, Diskret. analiz i issled. operatsii, 16:1 (2009), 80–92 | MR

[12] Tsvetkovich D., Dub M., Zakhs Kh., Spektry grafov. Teoriya i primenenie, Naukova dumka, Kiev, 1984, 384 pp. | MR

[13] Axenovich M. A., “On multiple coverings of the infinite rectangular grid with balls of constant radius”, Discrete Math., 268:1–3 (2003), 31–49 | DOI | MR

[14] Agustini E., Costa S. I. R., Muniz M., Palazzo R., “Graphs, tesselations, and perfect codes on flat tori”, IEEE Trans. Inf. Theory, 50:10 (2004), 2363–2377 | DOI | MR

[15] Dorbec P., Gravier S., Honkala I., Mollard M., “Weighted codes in Lee metrics”, Des. Codes Cryptography, 52 (2009), 209–218 | DOI | MR | Zbl

[16] Dorbec P., Gravier S., Honkala I., Mollard M., “Weighted perfect codes in Lee metric”, Electron. Notes Discrete Math., 34 (2009), 477–481 | DOI | MR

[17] Godsil C., “Equitable partitions”, Combinatorics. Paul Erdös is eighty, v. 1, Janos Bolyai Mathematical Society, Budapest, Hungary, 1993, 173–192 | MR | Zbl

[18] Krotov D. S., Perfect colorings of $\mathbb Z^2$: nine colors, 2008, 177 pp., arXiv: 0901.0004