Coloring and Independent Sets
According to Brooks' theorem every cubic graph other than the complete graph K4 can be colored with at most three colors. Therefore, every cubic graph other than K4 has an independent set of at least n/3 vertices, where n is the number of vertices in the graph: for instance, the largest color class in a 3-coloring has at least this many vertices.
According to Vizing's theorem every cubic graph needs either three or four colors for an edge coloring. A 3-edge-coloring is known as a Tait coloring, and forms a partition of the edges of the graph into three perfect matchings. By König's line coloring theorem every bicubic graph has a Tait coloring.
The bridgeless cubic graphs that do not have a Tait coloring are known as snarks. They include the Petersen graph, Tietze's graph, the Blanuša snarks, the flower snark, the double-star snark, the Szekeres snark and the Watkins snark. There is an infinite number of distinct snarks.
Read more about this topic: Cubic Graph
Famous quotes containing the words independent and/or sets:
“We are independent of the change we detect. The longer the lever, the less perceptible its motion. It is the slowest pulsation which is the most vital. The hero then will know how to wait, as well as to make haste. All good abides with him who waiteth wisely; we shall sooner overtake the dawn by remaining here than by hurrying over the hills of the west.”
—Henry David Thoreau (1817–1862)
“In the beautiful, man sets himself up as the standard of perfection; in select cases he worships himself in it.... Man believes that the world itself is filled with beauty—he forgets that it is he who has created it. He alone has bestowed beauty upon the world—alas! only a very human, an all too human, beauty.”
—Friedrich Nietzsche (1844–1900)