The perfect colorings of circulant graphs with a large number of colors

被引：0
|
作者：
Lisitsyna, Mariya Aleksandrovna [1 ]
Avgustinovich, Sergey Vladimirovich [2 ]
机构：
[1] Mozhaisky Mil Space Acad, Zhdanovskaya 13, St Petersburg 197198, Russia
[2] Sobolev Inst Math, Pr Koptyuga 4, Novosibirsk 630090, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2024年 / 21卷 / 01期
关键词：
perfect coloring; infinite circulant graph; k-motley fragment;
D O I：
10.33048/semi.2024.21.013
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An infinite circulant graph with a continuous set of distances is a graph, whose set of vertices is the set of integers, and two vertices i and j are adjacent if |i - j| is an element of{1, 2, . . . , n}. We study perfect colorings of such graph with k colors for k at least 3n + 3. A complete description of them is obtained.
引用
收藏
页码：188 / 195
页数：8
相关论文
共 50 条
  • [1] Colorings of hypergraphs with large number of colors
    Akolzin, Ilia
    Shabanov, Dmitry
    DISCRETE MATHEMATICS, 2016, 339 (12) : 3020 - 3031
  • [2] NEW PERFECT COLORINGS OF INFINITE CIRCULANT GRAPHS WITH CONTINUOUS SETS OF DISTANCES
    Plaksina, V. D.
    Shcherbina, P. A.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2021, 18 : 530 - 533
  • [3] Total colorings of circulant graphs
    Geetha, J.
    Somasundaram, K.
    Fu, Hung-Lin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (05)
  • [4] Perfect 2-colorings of infinite circulant graphs with continuous set of distances
    Parshina O.G.
    Journal of Applied and Industrial Mathematics, 2014, 8 (03) : 357 - 361
  • [5] Achromatic and Harmonious Colorings of Circulant Graphs
    Debski, Michal
    Lonc, Zbigniew
    Rzazewski, Pawel
    JOURNAL OF GRAPH THEORY, 2018, 87 (01) : 18 - 34
  • [6] THE PERFECT 2-COLORINGS OF INFINITE CIRCULANT GRAPHS WITH A CONTINUOUS SET OF ODD DISTANCES
    Parshina, O. G.
    Lisitsyna, M. A.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2020, 17 : 590 - 603
  • [7] Upper bounds on the number of colors in interval edge-colorings of graphs
    Hambardzumyan, Arsen
    Muradyan, Levon
    DISCRETE MATHEMATICS, 2025, 348 (01)
  • [8] Sequential colorings and perfect graphs
    Maffray, F
    Preissmann, M
    DISCRETE APPLIED MATHEMATICS, 1999, 94 (1-3) : 287 - 296
  • [9] Perfect codes in circulant graphs
    Feng, Rongquan
    Huang, He
    Zhou, Sanming
    DISCRETE MATHEMATICS, 2017, 340 (07) : 1522 - 1527
  • [10] SET COLORINGS IN PERFECT GRAPHS
    Gera, Ralucca
    Okamoto, Futaba
    Rasmussen, Craig
    Zhang, Ping
    MATHEMATICA BOHEMICA, 2011, 136 (01): : 61 - 68
12345