Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs - Details

author：

Chen, Rong (Chen, Rong.) ^[1] (Scholars：陈容) | Lan, Kaiyang (Lan, Kaiyang.) ^[2] | Lin, Xinheng (Lin, Xinheng.) ^[3] | Zhou, Yidong (Zhou, Yidong.) ^[4]

Indexed by：

Scopus SCIE

Abstract：

The　Borodin-Kostochka　Conjecture　states　that　for　a　graph　G,　if　Delta(G)＞=　9\documentclass[12pt]{minimal}　\usepackage{amsmath}　\usepackage{wasysym}　\usepackage{amsfonts}　\usepackage{amssymb}　\usepackage{amsbsy}　\usepackage{mathrsfs}　\usepackage{upgreek}　\setlength{\oddsidemargin}{-69pt}　\begin{document}$$\Delta　(G)\ge　9$$\end{document},　then　chi(G)＜=　max{Delta(G)-1,omega(G)}\documentclass[12pt]{minimal}　\usepackage{amsmath}　\usepackage{wasysym}　\usepackage{amsfonts}　\usepackage{amssymb}　\usepackage{amsbsy}　\usepackage{mathrsfs}　\usepackage{upgreek}　\setlength{\oddsidemargin}{-69pt}　\begin{document}$$\chi　(G)\le　\max　\{\Delta　(G)-1,\omega　(G)\}$$\end{document}.　In　this　paper,　we　prove　the　Borodin-Kostochka　Conjecture　holding　for　odd-hole-free　graphs.

Keyword：

Borodin-Kostochka conjecture Chromatic number Odd-hole-free graphs

Community：

[ 1 ] [Chen, Rong]Fuzhou Univ, Ctr Discrete Math, Fujian 350003, Peoples R China
[ 2 ] [Lan, Kaiyang]Fuzhou Univ, Ctr Discrete Math, Fujian 350003, Peoples R China
[ 3 ] [Lin, Xinheng]Fuzhou Univ, Ctr Discrete Math, Fujian 350003, Peoples R China
[ 4 ] [Zhou, Yidong]Fuzhou Univ, Ctr Discrete Math, Fujian 350003, Peoples R China