共 50 条
The Chromatic Number of a Graph with Two Odd Holes and an Odd Girth
被引:0
|作者:
Lan, Kaiyang
[1
]
Liu, Feng
[2
]
机构:
[1] Fuzhou Univ, Ctr Discrete Math, Fujian 350003, Peoples R China
[2] East China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
关键词:
Chromatic number;
Girth;
Odd hole;
D O I:
10.1007/s00373-023-02723-y
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
An odd hole is an induced odd cycle of length at least five. Let l >= 2 be an integer, and let G(l) denote the family of graphs which have girth 2l + 1 and have no holes of odd length at least 2l + 5. In this paper, we prove that every graph G is an element of U(l >= 3)G(l) is 4-colourable.
引用
下载
收藏
页数:6
相关论文