Skip to main content Accessibility help
×
Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T03:39:42.171Z Has data issue: false hasContentIssue false

2 - Brooks's theorem

Published online by Cambridge University Press:  05 May 2015

Michael Stiebitz
Affiliation:
Technical University Ilmenau
Bjarne Toft
Affiliation:
University of London
Lowell W. Beineke
Affiliation:
Purdue University, Indiana
Robin J. Wilson
Affiliation:
The Open University, Milton Keynes
HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Summary

R. L. Brooks's seminal paper [4] of 1941 contains the first result – known as Brooks's theorem – on colouring abstract graphs. That it is worthwhile to study the chromatic number of graphs in general, rather than just planar graphs, was pointed out already by A. B. Kempe in 1879 in his paper [28] about mapcolouring. However, it was only with the paper by Brooks that vertex-colouring of abstract graphs became a topic of study. Over the years, this topic has developed into a rich theory and, as emphasized by B. Reed in his extensive paper [51], Brooks's theorem is just the tip of the iceberg.

Introduction

In this chapter only simple graphs are considered. Brooks's theorem relates the chromatic number to the maximum degree of a graph. In modern terminology Brooks's result is as follows:

Let G be a graph with maximum degree Δ, where Δ > 2, and suppose that no connected component of G is a complete graph KΔ+1. Then it is possible to colour the vertices of G with Δ colours so that no two vertices of the same colour are adjacent, and hence G has chromatic number at most Δ.

Brooks noticed that it suffices to prove the result for connected graphs, since the connected components of a graph can be coloured independently of each other. Furthermore, he observed that every graph with maximum degree Δ admits a (Δ+ 1)-colouring, by giving to each vertex in turn a colour different from all those colours already assigned to vertices to which it is adjacent. The three missing cases, where Δ = 0, 1, 2, can be easily included in Brooks's theorem. So another possible way of formulating Brooks's fundamental result is as follows.

Theorem 1.1 (Brooks's theorem) Let G be a connected graph of maximum degree Δ. Then χ(G) ≤ Δ+1, where equality holds if and only if G is a complete graph or an odd cycle.

Information

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×