A short proof of Catlin's extension of B
✍
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