On Perfect Colorings of Paths Divisible by a Matching Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2022, Volume: 16, Number: 1, Pages: 98-104 Pages count : 7 DOI: 10.1134/S1990478922010094 | ||||
| Tags | equitable partition; infinite path graph; lexicographic product; matching; perfect coloring | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | 0314-2019-0016 |
Abstract:
Abstract: A vertex coloring of a graph G is said to be perfect if the color structure of the neighborhood of each vertexdepends only on the color of the vertex. We give a complete characterization of perfect coloringswith an arbitrary number of colors for the lexicographic product of an infinite path graph by amatching. © 2022, Pleiades Publishing, Ltd.
Cite:
Lisitsyna M.A.
, Avgustinovich S.V.
On Perfect Colorings of Paths Divisible by a Matching
Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.98-104. DOI: 10.1134/S1990478922010094 Scopus РИНЦ OpenAlex
On Perfect Colorings of Paths Divisible by a Matching
Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.98-104. DOI: 10.1134/S1990478922010094 Scopus РИНЦ OpenAlex
Original:
Лисицына М.А.
, Августинович С.В.
О совершенных раскрасках цепей, кратных паросочетанию
Дискретный анализ и исследование операций. 2022. Т.29. №1. С.33-45. DOI: 10.33048/daio.2022.29.718 РИНЦ OpenAlex
О совершенных раскрасках цепей, кратных паросочетанию
Дискретный анализ и исследование операций. 2022. Т.29. №1. С.33-45. DOI: 10.33048/daio.2022.29.718 РИНЦ OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85134222539 |
| Elibrary: | 51414600 |
| OpenAlex: | W4285410659 |
Citing:
| DB | Citing |
|---|---|
| Scopus | 1 |