An Improved Bound on the Chromatic Number of the Pancake Graphs

被引:0
|
作者
Konstantinova, Elena [1 ]
Droogendijk, Leen
机构
[1] Sobolev Inst Math, Novosibirsk 630090, Russia
关键词
Pancake graph; chromatic number; equitable coloring; CODES;
D O I
10.7151/dmgt.2432
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, an improved bound on the chromatic number of the Pancake graph P-n, n > 9, is presented. The bound is obtained using a subadditivity property of the chromatic number of the Pancake graph. We also investigate an equitable coloring of P-n. An equitable (n - 1)-coloring based on efficient dominating sets is given and optimal equitable 4-colorings are considered for small n. It is conjectured that the chromatic number of P-n coincides with its equitable chromatic number for any n > 2.
引用
收藏
页码:35 / 46
页数:12
相关论文
共 50 条
  • [21] A topological lower bound for the chromatic number of a special family of graphs
    Daneshpajouh, Hamid Reza
    DISCRETE MATHEMATICS, 2018, 341 (02) : 508 - 512
  • [22] An Upper Bound on the Chromatic Number of 2-Planar Graphs
    Karpov, Dmitri, V
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (03) : 703 - 720
  • [23] IMPROVED BOUNDS FOR THE CHROMATIC NUMBER OF THE LEXICOGRAPHIC PRODUCT OF GRAPHS
    KASCHEK, R
    KLAVZAR, S
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1994, 25 (12): : 1267 - 1274
  • [24] Improved upper bound for the degenerate and star chromatic numbers of graphs
    Jiansheng Cai
    Xueliang Li
    Guiying Yan
    Journal of Combinatorial Optimization, 2017, 34 : 441 - 452
  • [25] Improved upper bound for the degenerate and star chromatic numbers of graphs
    Cai, Jiansheng
    Li, Xueliang
    Yan, Guiying
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 441 - 452
  • [26] The Upper Bound and Lower Bound of the Genus of Pancake Graphs
    Nguyen, Quan T.
    Bettayeb, Said
    ISCC: 2009 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, 2009, : 799 - 803
  • [27] On the chromatic number of graphs
    Butenko, S
    Festa, P
    Pardalos, PM
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 109 (01) : 51 - 67
  • [28] On the Chromatic Number of Graphs
    S. Butenko
    P. Festa
    P. M. Pardalos
    Journal of Optimization Theory and Applications, 2001, 109 (1) : 69 - 83
  • [29] A BOUND FOR THE CHROMATIC NUMBER OF (P5, GEM)-FREE GRAPHS
    Cameron, Kathie
    Huang, Shenwei
    Merkel, Owen
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2019, 100 (02) : 182 - 188
  • [30] A smaller upper bound for the list injective chromatic number of planar graphs
    Chen, Hongyu
    Zhang, Li
    AIMS MATHEMATICS, 2025, 10 (01): : 289 - 310