Perfect colorings of the prism graph
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 13 (2016), pp. 1116-1128

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

The cartesian product of an infinite chain by an edge is termed the infinite prism graph. A complete description of perfect colorings is obtained for prism graph. Bipartition of mentioned graph was used essentially by researchers. It's easy to adapt all results to finite case — finite prism graph and Mobius ladder.
Keywords: prism graph, Mobius ladder, perfect coloring, induced coloring.
Mots-clés : equitable partition, bipartite graph
@article{SEMR_2016_13_a65,
     author = {M. A. Lisitsyna and S. V. Avgustinovich},
     title = {Perfect colorings of the prism graph},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {1116--1128},
     publisher = {mathdoc},
     volume = {13},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2016_13_a65/}
}
TY  - JOUR
AU  - M. A. Lisitsyna
AU  - S. V. Avgustinovich
TI  - Perfect colorings of the prism graph
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2016
SP  - 1116
EP  - 1128
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2016_13_a65/
LA  - ru
ID  - SEMR_2016_13_a65
ER  - 
%0 Journal Article
%A M. A. Lisitsyna
%A S. V. Avgustinovich
%T Perfect colorings of the prism graph
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2016
%P 1116-1128
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2016_13_a65/
%G ru
%F SEMR_2016_13_a65
M. A. Lisitsyna; S. V. Avgustinovich. Perfect colorings of the prism graph. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 13 (2016), pp. 1116-1128. http://geodesic.mathdoc.fr/item/SEMR_2016_13_a65/