Sect. 10: ## 2(ii)(second graph) (and also go backwards: from the tree to the sequence, as a check), 5; Sect. 12 ## 5(ii), 10(Petersen graph); # C2.
Problem Set C
The problems refer to the graph H shown. (This is the same H as on the last test.)
- Hamiltonicity:
- Show that H has a unique Hamiltonian cycle.
- Find all edges e such that H-e has no Hamiltonian cycle.
- Planarity:
- Decide whether H is planar.
- Let H' be H with the edges x6x7 and x10x12 added. Decide whether H' is planar. Use two different methods if you can find the time.
HOMEWORK IX
For Wed. 4/3:
Read Sects. 13 and 14.
Due Thurs. 4/4:
Do Sect. 13 ## 1(i-iii), 2(i), 3(i), 4.
Due Fri. 4/5:
Do Sect. 13 ## 2(ii), 3(ii), 6, 8(i), 9.
Do Sect. 14 # 1.
Hand in Mon. 4/8:
Sect. 13: ## 1(iv), 5, 7, 8(ii), 10.
Sect. 14: # 2.
HOMEWORK X
For Mon. 4/8:
Read Sects. 15, 17, and 19.
Due Thurs. 4/11:
Do Sect. 15 ## 1--5, 6(i), 7.
Do Sect. 17 ## 1, 4, 7.
Due Fri. 4/12:
Do Sect. 15 ## 6(ii), 9.
Do Sect. 17 ## 2, 3, 6, 8, 10, 11(i).
Do Sect. 19 ## 1(i), 2(cube, iscosahedron), 3, 5.
Hand in Mon. 4/15:
Sect. 15: ## 10.
Sect. 17: ## 5, 9 (see correction), 11(ii,iii).
Sect. 19: ## 1(ii), 4.
HOMEWORK XI
For Wed. 4/17:
Read Sect. 20.
Due Thurs. 4/18:
Do Sect. 20 ## 1, 3(graphs 17-21), 4, 6, 8, 9; and # D1.
Hand in Mon. 4/22:
Sect. 20: ## 2, 7, 10.
Problem Set D
- Use the inductive method of the proofs of Theorems 17.1 and 17.3 to actually color the graph G in 5 colors. (This is the correct problem. The previously announced version with 4 was a mistake. Sorry.)
HOMEWORK XII
For Mon. 4/22:
Read Sect. 21.
Due Mon. 4/22 (changed to Fri. 4/26):
Do Sect. 21 ## 1, 2(do any two of the six graphs), 3, 5, 6.
Due Wed. 4/24 (changed to Fri. 4/26):
Do Sect. 21 ## 4, 7.
Review for Test II on Thurs. 4/25.
HOMEWORK XIII
For Mon. 4/29:
Read Sect. 22 (to the statement of Theorem 22.1; omit the rest of the section) and Sect. 25.
Due Wed. 5/1:
Do Sect. 22 ## 1, 2, 5.
Do Sect. 25 ## 1, 3, 5. (See correction.)
Due Thurs. 5/2:
Do Sect. 25 # 6(i).
Hand in Fri. 5/3:
Sect. 25 ## 2, 4, 6(ii).
HOMEWORK XIV
For Fri. 5/3:
Read Sect. 28.
Due Mon. 5/6:
Do Sect. 28 ## 1, 2(i), 4(i), 5(i), 6.
Do ## E1, E3c(first digraph).
Due Wed. 5/8:
Do Sect. 28 ## 4(ii), 5(ii).
Do # E2.
Hand in Wed. 5/8:
Sect. 28 ## 2(ii), 4(iii), 5(iii).
## E3a, E3c(second digraph).
HOMEWORK XV
Due Thurs. 5/9:
Do ## E3(b), E4-E6.
Do # E7.
Problem Set E
- Deduce the vertex Menger's theorem 28.2 from the edge Menger's theorem 28.1. (NOTE: This problem seems to be a mistake.)
- Deduce the undirected edge Menger's theorem 28.1 from the directed edge Menger's theorem 28.5.
- Theorem 28.5 is a digraph version of Theorem 28.1. Theorem 28.7 (see the statement and the associated definitions), which the author forgot to print, is a digraph version of Theorem 28.2.
- Deduce Theorem 28.7 from Theorem 28.5.
- Deduce Theorem 28.2 from Theorem 28.7.
- Verify Theorem 28.7 for each digraph in Figure 28.7.
- Find the chromatic number of the following graph.
- Let G be a simple graph of order n >= 3 having m edges.
- Prove that cr(G) >= m - 3(n-2).
- If G has no triangles, then cr(G) >= m - 2(n-2).
- Let H = Kr,r - M where M is the edge set
{ xiyi : i = 1, 2, ..., r }.
- Find out as much as you can about the thickness t(H).
- Also find out as much as you can about cr(H).
I suggest that you start with small values of r.
- In the graph of Problem E4, verify Menger's Theorems 28.1 and 28.2 between the vertices s and p. This means: find the number k which is both the largest number of edge-disjoint (or, internally disjoint) sp-paths and the smallest number of edges whose removal disconnects s from p.
For additional practice, try other pairs of vertices. Each different pair is a different problem.
Go to announcements | course information | syllabus.