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:
“All the rights secured to the citizens under the Constitution are worth nothing, and a mere bubble, except guaranteed to them by an independent and virtuous Judiciary.”
—Andrew Jackson (1767–1845)
“I would rather have as my patron a host of anonymous citizens digging into their own pockets for the price of a book or a magazine than a small body of enlightened and responsible men administering public funds. I would rather chance my personal vision of truth striking home here and there in the chaos of publication that exists than attempt to filter it through a few sets of official, honorably public-spirited scruples.”
—John Updike (b. 1932)