Partitioning and coloring with degree constraints

Details Partitioning and coloring with degree constraints Partitioning and coloring with degree constraints

2012-02-27

arxiv.org/abs/1202.5855v1

Mathematics

Combinatorics

Scientific paper

We prove that if $G$ is a vertex critical graph with $\chi(G) \geq \Delta(G) + 1 - p \geq 4$ for some $p \in \mathbb{N}$ and $\omega(\fancy{H}(G)) \leq \frac{\chi(G) + 1}{p + 1} - 2$, then $G = K_{\chi(G)}$ or $G = O_5$. Here $\fancy{H}(G)$ is the subgraph of $G$ induced on the vertices of degree at least $\chi(G)$. This simplifies and improves the results in the paper of Kostochka, Rabern and Stiebitz \cite{krs_one}.

Affiliated with

Also associated with

No associations

Rating

Partitioning and coloring with degree constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partitioning and coloring with degree constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning and coloring with degree constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263045