Hostname: page-component-848d4c4894-2pzkn Total loading time: 0 Render date: 2024-06-01T22:36:09.113Z Has data issue: false hasContentIssue false
  • English
  • Français

The Effective Version of Brooks' Theorem

Published online by Cambridge University Press:  20 November 2018

James H. Schmerl
James H. Schmerl*
Affiliation:
The University of Connecticut, Storrs, Connecticut
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 34 , Issue 5 , 01 October 1982 , pp. 1036 - 1046
Copyright
Copyright © Canadian Mathematical Society 1982

References

1. Brooks, R. L., On colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941), 194–197./Google Scholar
2. deBruijn, N. G. and Erdos, P., A colour problem for infinite graphs and a problem in the theory of relations, Kon. Ned. Akad. Wetensch. Proc, Ser. A 5/+ (1951), 371–373./Google Scholar
3. Lovâsz, L., Three short proofs in graph theory, J. Comb. Th. (B) 19 (1975), 269–271./Google Scholar
4. Melnikov, L. S. and Vizing, V. G., A new proof of Brooks’ Theorem, J. Comb. Th. 7 (1969), 289–290./Google Scholar
5. Ponstein, H., A new proof of Brooks’ chromatic number theorem for graphs, J. Comb. Th. 7 (1969), 255–257./Google Scholar
6. Rogers, H. Jr., Theory of recursive functions and effective computability (McGraw-Hill, New York, 1967./Google Scholar
7. Schmerl, J. H., Recursive colorings of graphs. Can. J. Math. 32 (1980), 821–830./Google Scholar