Borodin–Kostochka Conjecture Holds for 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]

Indexed by：

Scopus

Abstract：

The　Borodin–Kostochka　Conjecture　states　that　for　a　graph　G,　if　Δ(G)≥9,　then　χ(G)≤max{Δ(G)-1,ω(G)}.　In　this　paper,　we　prove　the　Borodin–Kostochka　Conjecture　holding　for　odd-hole-free　graphs.　©　The　Author(s),　under　exclusive　licence　to　Springer　Nature　Japan　KK,　part　of　Springer　Nature　2024.

Keyword：

05C15 05C17 05C69 Borodin–Kostochka conjecture Chromatic number Odd-hole-free graphs

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 ] [Lin X.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 4 ] [Zhou Y.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China

Reprint 's Address：

Email：

Show more details

Related Keywords：

Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs
2024，GRAPHS AND COMBINATORICS
The chromatic number of odd-hole-free graphs
2025，DISCRETE APPLIED MATHEMATICS
Acyclic Edge Chromatic Number of Outerplanar Graphs (vol 64, pg 22, 2010)
2013，JOURNAL OF GRAPH THEORY
THE TWO-COLORING NUMBER AND DEGENERATE COLORINGS OF PLANAR GRAPHS
2009，SIAM JOURNAL ON DISCRETE MATHEMATICS
THE CHROMATIC NUMBER OF (P-6, C-4, diamond)-FREE GRAPHS
2022，BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY

Source ：

Graphs and Combinatorics

ISSN： 0911-0119

Year： 2024

Issue： 2

Volume： 40

0 . 6 0 0

JCR@2023

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 1

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to