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
关键词
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 条