ON PERFECT COLORINGS OF INFINITE MULTIPATH GRAPHS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F20%3A00382597" target="_blank" >RIV/68407700:21340/20:00382597 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.33048/semi.2020.17.139" target="_blank" >https://doi.org/10.33048/semi.2020.17.139</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.33048/semi.2020.17.139" target="_blank" >10.33048/semi.2020.17.139</a>
Alternative languages
Result language
angličtina
Original language name
ON PERFECT COLORINGS OF INFINITE MULTIPATH GRAPHS
Original language description
A coloring of vertices of a given graph is called perfect if the color structure of each sphere of radius 1 in the graph depends only on the color of the sphere center. Let n be a positive integer. We consider a lexicographic product of the infinite path graph and a graph G that can be either the complete or empty graph on n vertices. We give a complete description of perfect colorings with an arbitrary number of colors of such graph products.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Siberian Electronic Mathematical Reports
ISSN
1813-3304
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
December
Country of publishing house
RU - RUSSIAN FEDERATION
Number of pages
12
Pages from-to
2084-2095
UT code for WoS article
000615617100001
EID of the result in the Scopus database
2-s2.0-85099189888