Coloring $(P_5, \text{gem})$-free graphs with $\Delta -1$ colors

The Borodin-Kostochka Conjecture states that for a graph $G$ , if $\Delta(G) \geq 9 $a n d$ \omega(G) \leq \Delta(G)-1 $, t h e n$ \chi(G)\leq\Delta(G) -1$. We prove the Borodin-Kostochka Conjecture for $(P_{5}, gem)$ -free graphs, i.e., graphs with no induced $P_{5}$ and no induced $K_{1} \lor P_{4}$ .

Coloring $(P_{5}, gem)$ -free graphs with $Δ - 1$ colors

文献摘要

讨论

讲解博客

AI智能校验

Coloring $(P_{5}, gem)$ -free graphs with $Δ - 1$ colors

文献摘要

讨论

讲解博客

AI智能校验

Coloring (P5,gem)(P5​,gem)-free graphs with Δ−1Δ−1 colors

文献摘要

讨论

|讲解博客

|AI智能校验

Coloring (P5,gem)(P5​,gem)-free graphs with Δ−1Δ−1 colors

文献摘要

讨论

|讲解博客

|AI智能校验

Coloring $(P_{5}, gem)$ -free graphs with $Δ - 1$ colors

讲解博客

AI智能校验

Coloring $(P_{5}, gem)$ -free graphs with $Δ - 1$ colors

讲解博客

AI智能校验