Geodesic
On two-colour perfect colourings of circular graphs
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 1, pp. 80-92

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

We consider perfect colourings of a certain class of infinite graphs called circular graphs. It is shown that every such perfect colouring yields a perfect colouring of an $n$-dimensional infinite lattice which has the same parameters as the original colouring. A construction that produces two-colour perfect colourings of circular graphs is proposed and the parameters of perfect colourings given by the construction are enumerated. Bibl. 12.
Keywords: perfect colouring, circular graph
Mots-clés : equitable partition. 
@article{DA_2009_16_1_a4,
     author = {D. B. Khoroshilova},
     title = {On two-colour perfect colourings of circular graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {80--92},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_1_a4/}
}
TY  - JOUR
AU  - D. B. Khoroshilova
TI  - On two-colour perfect colourings of circular graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 80
EP  - 92
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_1_a4/
LA  - ru
ID  - DA_2009_16_1_a4
ER  - 
%0 Journal Article
%A D. B. Khoroshilova
%T On two-colour perfect colourings of circular graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 80-92
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_1_a4/
%G ru
%F DA_2009_16_1_a4
D. B. Khoroshilova. On two-colour perfect colourings of circular graphs. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 1, pp. 80-92. http://geodesic.mathdoc.fr/item/DA_2009_16_1_a4/