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 条
  • [21] Perfect colorings of the infinite circulant graph with distances 1 and 2
    Lisitsyna M.A.
    Parshina O.G.
    Journal of Applied and Industrial Mathematics, 2017, 11 (03) : 381 - 388
  • [22] GRAPHS WITH LEAST NUMBER OF COLORINGS
    SAKALOGLU, A
    SATYANARAYANA, A
    JOURNAL OF GRAPH THEORY, 1995, 19 (04) : 523 - 533
  • [23] PERFECT COLORINGS OF ISONEMAL FABRICS USING 2 COLORS
    ROTH, RL
    GEOMETRIAE DEDICATA, 1995, 56 (03) : 307 - 326
  • [24] TURAN GRAPHS AND THE NUMBER OF COLORINGS
    Norine, Serguei
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (01) : 260 - 266
  • [25] On the chromatic number of circulant graphs
    Barajas, Javier
    Serra, Oriol
    DISCRETE MATHEMATICS, 2009, 309 (18) : 5687 - 5696
  • [26] Total colorings of some classes of four regular circulant graphs
    Navaneeth, R.
    Geetha, J.
    Somasundaram, K.
    Fu, Hung-Lin
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2024, 21 (01) : 1 - 3
  • [27] TEST FRAGMENTS OF PERFECT COLORING OF CIRCULANT GRAPHS
    Lisitsyna, M. A.
    Avgustinovich, S., V
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2023, 20 (02): : 638 - 645
  • [28] On graphs with a large number of edge-colorings avoiding a rainbow triangle
    Hoppen, Carlos
    Lefmann, Hanno
    Odermann, Knut
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 168 - 190
  • [29] Perfect 2-colorings of Hamming graphs
    Bespalov, Evgeny A.
    Krotov, Denis S.
    Matiushev, Aleksandr A.
    Taranenko, Anna A.
    Vorob'ev, Konstantin V.
    JOURNAL OF COMBINATORIAL DESIGNS, 2021, 29 (06) : 367 - 396
  • [30] ON THE 2-EDGE-COLORINGS OF PERFECT GRAPHS
    HOANG, CT
    JOURNAL OF GRAPH THEORY, 1995, 19 (02) : 271 - 279
12345