✦ LIBER ✦

Precoloring Extensions of Brooks' Theorem

✍ Scribed by Albertson, Michael O.; Kostochka, Alexandr V.; West, Douglas B.

Book ID: 118198893
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 232 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480103425942

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SURVEY OF EXTENSIONS OF BROOKS' GRAPH CO

SURVEY OF EXTENSIONS OF BROOKS' GRAPH COLORING THEOREM

✍ Paul A. Catlin 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Precoloring Extension of Co-Meyniel Grap

Precoloring Extension of Co-Meyniel Graphs

✍ Vincent Jost; Benjamin Lévêque; Frédéric Maffray 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 123 KB

An extension of Brooks' theorem to n-deg

An extension of Brooks' theorem to n-degenerate graphs

✍ John Mitchem 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Fw rl ~~(t,~R(QG) denotes the Lick-White vertex-partition number of C In this paper genera',xd Kcmpe paths are used to prove rhat ~"(4;) s {J(G)/(n + I)) if G is not an odd cycle, an (n h I )-regular graph. nor a complete graph on r(n + 1) + 1 vertices. This result generalizes theorems of Brooks and

A short proof of Catlin's extension of B

A short proof of Catlin's extension of Brooks' theorem

✍ John Mitchem 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Recently, in [3], Catlin proved the following extension of Brooks' Theorem [2]. T&eortln 1. Let G be u connected graph with muximcrm degree A(G) = h. If G is neither complete nor an odd cycle, then there exists an h-coloring of G with a monmhromatic maximum independent set. In addition to being of s

A Strengthening of Brooks' Theorem

✍ Bruce Reed 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Extensions of Hamburger's Theorem

✍ Torben Maack Bisgaard 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 265 KB