Nearly antipodal chromatic number of even paths

被引：0
|
作者：
Shen, Yufa [1 ,2 ]
Guo, Jun [3 ]
Xiao, Xin [1 ]
Tang, Qing [3 ]
机构：
[1] Hebei Normal Univ Sci & Technol, Dept Math, Qinhuangdao 066004, Peoples R China
[2] Hebei Normal Univ, Ctr Math Hebei Prov, Shijiazhuang 050016, Peoples R China
[3] Hebei Univ Technol, Inst Appl Math, Tianjin 300401, Peoples R China
来源：
ARS COMBINATORIA | 2011年 / 99卷
关键词：
Radio colorings; Nearly antipodal chromatic number; Paths;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For paths P-n, Chartrand, Nebesky and Zhang gave the exact value of ac'(P-n) for n <= 8, and showed that ac'(P-n) <= (n-2 2) + 2 for every positive integer n, where ac'(P-n) denotes the nearly antipodal chromatic number of P-n. In this paper, we determine the exact values of ac'(P-n) for all even integers n >= 8.
引用
收藏
页码：217 / 224
页数：8
相关论文
共 50 条
  • [31] On the number of antipodal bicolored necklaces
    Luca, Florian
    Strausz, Ricardo
    AEQUATIONES MATHEMATICAE, 2012, 83 (1-2) : 67 - 73
  • [32] On the fractional chromatic number, the chromatic number, and graph products
    Klavzar, S
    Yeh, HG
    DISCRETE MATHEMATICS, 2002, 247 (1-3) : 235 - 242
  • [33] Packing chromatic number versus chromatic and clique number
    Bresar, Bostjan
    Klavzar, Sandi
    Rall, Douglas F.
    Wash, Kirsti
    AEQUATIONES MATHEMATICAE, 2018, 92 (03) : 497 - 513
  • [34] Packing chromatic number versus chromatic and clique number
    Boštjan Brešar
    Sandi Klavžar
    Douglas F. Rall
    Kirsti Wash
    Aequationes mathematicae, 2018, 92 : 497 - 513
  • [35] Irredundance chromatic number and gamma chromatic number of trees
    Kalarkop, David Ashok
    Kaemawichanurat, Pawaton
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024,
  • [36] Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
    Steffen, Eckhard
    Wolf, Isaak H.
    GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [37] Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
    Eckhard Steffen
    Isaak H. Wolf
    Graphs and Combinatorics, 2022, 38
  • [38] A better upper bound on the chromatic number of (cap, even-hole)-free graphs
    Xu, Yian
    DISCRETE MATHEMATICS, 2021, 344 (11)
  • [39] Nearly orthogonal vectors and small antipodal spherical codes
    Boris Bukh
    Christopher Cox
    Israel Journal of Mathematics, 2020, 238 : 359 - 388
  • [40] Nearly orthogonal vectors and small antipodal spherical codes
    Bukh, Boris
    Cox, Christopher
    ISRAEL JOURNAL OF MATHEMATICS, 2020, 238 (01) : 359 - 388
12345