h7 - 1 ( G ) = ( G ). 4. Is there a 2006-regular simple...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MATH 4171 Graph Theory SPRING 2006 Homework Set VII (4 problems) Due date : Monday 5-1-06 1. Prove without using Theorem 8.24 that every planar graph is 6-colorable. 2. For the graph G below, prove that χ ( G ) = 4 by showing: (a) χ ( G ) 4; and (b) χ ( G ) > 3. 3. Let G be a loopless bipartite graph. Prove that
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 ( G ) = ( G ). 4. Is there a 2006-regular simple graph G on 4171 vertices for which 1 ( G ) = 2006? You need to justify your conclusion. Important No Late Homework Will be Accepted...
View Full Document

This note was uploaded on 02/17/2009 for the course MATH 4171 taught by Professor Lax,r during the Spring '08 term at LSU.

Ask a homework question - tutors are online