Geodesic
On perfect colorings of paths divisible~by~a~matching
Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 33-45

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

A vertex coloring of a graph $G$ is called perfect if the color structure of the neighborhood of each vertex depends only on the color of this vertex. We give a complete characterization of perfect colorings with an arbitrary number of colors of the lexicographic product of the infinite path graph and the matching. Illustr. 1, bibliogr. 18.
Keywords: perfect coloring, infinite path graph, matching, lexicographic product.
Mots-clés : equitable partition 
@article{DA_2022_29_1_a2,
     author = {M. A. Lisitsyna and S. V. Avgustinovich},
     title = {On perfect colorings of paths divisible~by~a~matching},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {33--45},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2022_29_1_a2/}
}
TY  - JOUR
AU  - M. A. Lisitsyna
AU  - S. V. Avgustinovich
TI  - On perfect colorings of paths divisible~by~a~matching
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2022
SP  - 33
EP  - 45
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2022_29_1_a2/
LA  - ru
ID  - DA_2022_29_1_a2
ER  - 
%0 Journal Article
%A M. A. Lisitsyna
%A S. V. Avgustinovich
%T On perfect colorings of paths divisible~by~a~matching
%J Diskretnyj analiz i issledovanie operacij
%D 2022
%P 33-45
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2022_29_1_a2/
%G ru
%F DA_2022_29_1_a2
M. A. Lisitsyna; S. V. Avgustinovich. On perfect colorings of paths divisible~by~a~matching. Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 33-45. http://geodesic.mathdoc.fr/item/DA_2022_29_1_a2/