Chromatic Number and Hamiltonicity of Graphs

被引：0
|
作者：
Li, Rao [1 ]
机构：
[1] Dept. of Mathematical Sciences, University of South Carolina Aiken, Aiken,SC,29801, United States
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2020年 / 113卷
关键词：
D O I：
暂无
中图分类号：
O144 [集合论]; O157 [组合数学（组合学）];
学科分类号：
070104 ;
摘要：
Let G be a k-connected (k > 2) graph of order n. If > n-k} then G is Hamiltonian or Kk V U Kn-2k) with n > 2k +1, where X(G) is the chromatic number of the graph G. © 2020 Charles Babbage Research Centre. All rights reserved.
引用
收藏
页码：253 / 257
相关论文
共 50 条
  • [21] On the strong chromatic number of graphs
    Axenovich, Maria
    Martin, Ryan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (03) : 741 - 747
  • [22] Chromatic number and subtrees of graphs
    Xu, Baogang
    Zhang, Yingli
    FRONTIERS OF MATHEMATICS IN CHINA, 2017, 12 (02) : 441 - 457
  • [23] The chromatic number of oriented graphs
    Sopena, E
    JOURNAL OF GRAPH THEORY, 1997, 25 (03) : 191 - 205
  • [24] COMPLEMENTARY GRAPHS AND THE CHROMATIC NUMBER
    Starr, Colin L.
    Turner, Galen E., III
    MISSOURI JOURNAL OF MATHEMATICAL SCIENCES, 2008, 20 (01) : 19 - 26
  • [25] CHROMATIC NUMBER OF SKEW GRAPHS
    PAHLINGS, H
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 25 (03) : 303 - 306
  • [26] On Indicated Chromatic Number of Graphs
    Raj, S. Francis
    Raj, R. Pandiya
    Patil, H. P.
    GRAPHS AND COMBINATORICS, 2017, 33 (01) : 203 - 219
  • [27] On the chromatic number of tree graphs
    Estivill-Castro, V
    Noy, M
    Urrutia, J
    DISCRETE MATHEMATICS, 2000, 223 (1-3) : 363 - 366
  • [28] ON THE DYNAMIC CHROMATIC NUMBER OF GRAPHS
    Akbari, S.
    Ghanbari, M.
    Jahanbekam, S.
    COMBINATORICS AND GRAPHS, 2010, 531 : 11 - +
  • [29] On the chromatic number of disk graphs
    Malesinska, E
    Piskorz, S
    Weissenfels, G
    NETWORKS, 1998, 32 (01) : 13 - 22
  • [30] On the injective chromatic number of graphs
    Hahn, G
    Kratochvíl, J
    Sirán, J
    Sotteau, D
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 179 - 192
12345