Coloring ΔΔ-Critical Graphs With Small High Vertex Cliques

preprint2011arXivOpen access

Abstract

We prove that Kχ(G)K_{χ(G)} is the only critical graph GG with χ(G)≥Δ(G)≥6χ(G) \geq Δ(G) \geq 6 and ω(H(G))≤⌊Δ(G)2⌋−2ω(\mathcal{H}(G)) \leq \left \lfloor \frac{Δ(G)}{2} \right \rfloor - 2. Here H(G)\mathcal{H}(G) is the subgraph of GG induced on the vertices of degree at least χ(G)χ(G). Setting ω(H(G))=1ω(\mathcal{H}(G)) = 1 proves a conjecture of Kierstead and Kostochka.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.