✦ LIBER ✦

SURVEY OF EXTENSIONS OF BROOKS' GRAPH COLORING THEOREM

✍ Scribed by Paul A. Catlin

Book ID: 118717494
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 224 KB
Volume: 328
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1979.tb17770.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Brooks' graph-coloring theorem and the i

Brooks' graph-coloring theorem and the independence number

✍ Paul A Catlin 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Precoloring Extensions of Brooks' Theore

Precoloring Extensions of Brooks' Theorem

✍ Albertson, Michael O.; Kostochka, Alexandr V.; West, Douglas B. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 232 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 dual version of the Brooks group color

A dual version of the Brooks group coloring theorem

✍ Deying Li; Suohai Fan; Hong-Jian Lai; Senmei Yao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 308 KB

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

Relaxed Coloring of a Graph

✍ Sunanda Bagchi 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 82 KB