Abstract
One of the fundamental results on graph coloring is the following classical theorem of Brooks.BROOKS’ THEOREM. Suppose that k ≧ 3 and that G is a k-regular graph which does not induce a (k + 1)-clique. Then G is k-colorable.Brooks proved his theorem in [1]; several more recent proofs have appeared in [3], [4] and [5]. All the proofs of this theorem have the common feature of applying only to finite graphs; the transition to infinite graphs can be accomplished by a very standard implementation of the Compactness Theorem (or some other equally noneffective device such as the theorem of deBruijn and Erdös [2] asserting that a graph is k-colorable if and only if each of its finite subgraphs is). Thus, it is not immediately apparent that an effective version of Brooks’ Theorem exists. It is our purpose to show, however, that the effective analogue of Brooks' Theorem is indeed true.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
