Homework 5
Due Tuesday, April 27, 1999
Each of the problems should be solved on a separate sheet of paper to facilitate grading. Limit the solution of each problem to one sheet of paper. Staple all these sheets together! Please don't wait until the last minute to look at the problems.
For each of the following questions, justify your answers:
a) For what values of n is Rn Eulerian?
b) For what values of n is Rn Hamiltonian?
c) For what values of n is Rn planar?
d) For what values of n does Rn have a perfect matching?
e) What is the chromatic number of Rn?
f) What is the vertex connectivity of Rn?
(a) Prove that if G is Eulerian, then L(G) is Eulerian and Hamiltonian.
(b) Prove that if G is Hamiltonian, then L(G) is Hamiltonian.