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

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-02-10 DOI:10.1007/s00373-024-02753-0

Rong Chen, Kaiyang Lan, Xinheng Lin, Yidong Zhou

引用次数: 0

Abstract

The Borodin–Kostochka Conjecture states that for a graph G, if \(\Delta (G)\ge 9\), then \(\chi (G)\le \max \{\Delta (G)-1,\omega (G)\}\). In this paper, we prove the Borodin–Kostochka Conjecture holding for odd-hole-free graphs.

查看原文本刊更多论文

无奇数孔图的鲍罗丁-科斯托奇卡猜想成立

Borodin-Kostochka 猜想指出，对于一个图 G，如果 \(\Delta (G)\ge 9\), 那么 \(\chi (G)\le \max \{Delta(G)-1,\omega(G)\}\)。在本文中，我们证明了鲍罗丁-科斯托奇卡猜想在奇数无洞图中成立。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.