The chromatic number of odd-hole-free graphs - Details

author：

Chen, R. (Chen, R..) ^[1] | Lan, K. (Lan, K..) ^[2] | Lin, X. (Lin, X..) ^[3] | Zhou, Y. (Zhou, Y..) ^[4] Unfold

Indexed by：

Scopus

Abstract：

In　this　paper,　we　prove　that　for　each　connected　odd-hole-free　graph　G,　χ(G)≤max{Δ(G)−1,ω(G)}　if　and　only　if　G　is　not　isomorphic　to　the　complement　of　C7.　©　2025　Elsevier　B.V.

Keyword：

Chromatic number Induced subgraphs Odd-hole-free

Community：

[ 1 ] [Chen R.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 2 ] [Lan K.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 3 ] [Lan K.]School of Mathematics and Statistics, Minnan Normal University, Fujian, 363000, China
[ 4 ] [Lin X.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 5 ] [Zhou Y.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China

Reprint 's Address：

Show more details

The chromatic number of odd-hole-free graphs
2025，DISCRETE APPLIED MATHEMATICS
Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs
2024，GRAPHS AND COMBINATORICS
Coloring hammer-free graphs with Δ-1 colors
2023，DISCRETE MATHEMATICS
Coloring {P2 U P3, house}-free graphs with △-1 colors
2023，DISCRETE APPLIED MATHEMATICS
Borodin-Kostochka conjecture holds for K 1, 3-free graphs
2024，DISCRETE APPLIED MATHEMATICS

Source ：

Discrete Applied Mathematics

ISSN： 0166-218X

Year： 2025

Volume： 370

Page： 84-87

1 . 0 0 0

JCR@2023

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

30 Days PV： 0

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

操作日志

管理员 2025-07-30 23:08:54 追加

管理员 2025-06-26 09:38:14 追加

管理员 2025-04-25 19:39:38 追加

管理员 2025-03-26 19:13:00 创建

Type
Departments

All Years Choose Year From to