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 条
  • [31] Perfect state transfer in integral circulant graphs
    Basic, Milan
    Petkovic, Marko D.
    Stevanovic, Dragan
    APPLIED MATHEMATICS LETTERS, 2009, 22 (07) : 1117 - 1121
  • [32] Perfect codes for metrics induced by circulant graphs
    Martinez, Cannen
    Beivide, Ramon
    Gabidulin, Emst
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (09) : 3042 - 3052
  • [33] 2-COLORINGS THAT DECOMPOSE PERFECT GRAPHS
    CHVATAL, V
    LENHART, WJ
    SBIHI, N
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 49 (01) : 1 - 9
  • [34] Asymmetric edge-colorings of graphs with three colors
    Grech, Mariusz
    Kisielewicz, Andrzej
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 106
  • [35] Perfect Colorings of the Infinite Square Grid: Coverings and Twin Colors
    Krotov, Denis S.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (02):
  • [36] On the broadcast independence number of circulant graphs
    Laouar, Abdelamin
    Bouchemakh, Isma
    Sopena, Eric
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (05)
  • [37] The number of spanning trees in circulant graphs
    Zhang, YP
    Yong, XR
    Golin, MJ
    DISCRETE MATHEMATICS, 2000, 223 (1-3) : 337 - 350
  • [38] A remark on the number of edge colorings of graphs
    Balogh, J
    EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (04) : 565 - 573
  • [39] INFINITE GRAPHS WITH A SPECIFIED NUMBER OF COLORINGS
    HECHLER, SH
    DISCRETE MATHEMATICS, 1977, 19 (03) : 241 - 255
  • [40] On the Lovasz number of certain circulant graphs
    Brimkov, VE
    Codenotti, B
    Crespi, V
    Leoncini, M
    ALGORITHMS AND COMPLEXITY, 2000, 1767 : 291 - 305
12345