Math 381: Graph Theory Homework Assignments


Go to announcements | course information | syllabus.

General Advice on Homework

Rules for Hand-In Homework.

  1. I expect complete written solutions that give full justification of the correctness of your answer. Answers without any justification will not be accepted. You'll gradually learn better what this means, so don't worry now, just do your best to explain your work.
  2. Hand in a final draft: neat work that is well organized and not cramped. Use as much space as you need. Please also leave some extra space between problems for my comments.
  3. You may discuss hand-in HW with other people, but you must write it up in your own words.
  4. No little stubbies from tearing a page out of your binder. Remove them neatly, please!
  5. Fasten the pages securely. Staples are best. Paper clips and folding a corner don't hold well; don't use them.

HOMEWORK I

For Wed. 1/24: Read Sect. 1.

Do (for class discussion Wed. and Thurs.) Sect. 1: all.
Hand in Mon. 2/4: Sect. 1:

HOMEWORK II

For Mon. 2/4:

Read Sect. 2.
Due Thurs. 2/7 (for discussion):
Do Sect. 2: ## 1-3, 5, 7, 8(i), 9, 10, 13.
Hand in Mon. 2/11: Sect. 2: ## 4, 8(ii), 11, 12.

HOMEWORK III

For Mon. 2/11:

Read Sects. 3, 4, 5 (to Corollary 5.3).
Due Wed.-Thurs. 2/13-14 (for discussion):
Do Sect. 2: # 14,
Do Sect. 3: ## 1-4, 8(ii), 9(i-iii),
Do Sect. 4: ## 1-3 (4 optional),
Do Sect. 5: ## 1(i-iii), 3, 4.
Hand in Mon. 2/18:
Sect. 3: ## 5, 6 (for up to 6 vertices), 8(i,iii), 9(iv,v).

HOMEWORK IV

For Mon. 2/18:

Read Sect. 3, 4, 5 (to Corollary 5.3).
Due Wed.-Thurs. 2/20-21 (for discussion):
Do Sect. 5: ## 1(iv), 2(i,ii,v), 6(i,ii), 7, 8,
Do Sect. 6: ## 1, 2, 3(i-iii), 4, 5.
Hand in Mon. 2/25:
Sect. 5: ## 2(vi), 9,
Sect. 6: ## 3(iv,v), 6.

HOMEWORK V

For Mon. 2/25:

Read Sect. 7.
Due Wed.-Thurs. 2/27-28 (for discussion):
Do Sect. 7: ## 1-8; and 10 is nice if you want to have fun with graphs.
Do ## A1, A3, A4, A5(a).
Hand in Mon. 3/4:
7.9, A2, A5(b,c).

Problem Set A

A1. Prove Corollary 6.3.

A2. Prove Corollary 6.4.

A3. Find another method, different from Fleury's, to generate an Eulerian trail.

A4. Find out exactly what's wrong with Exercise 5.8(ii) and, if you can, find a corrected version.

A5. In each graph, find a Hamilton cycle or prove there is none.

(a) Graph X.
(b) Graph Y.
(c) The Tutte graph.


HOMEWORK VI

For Mon. 3/4:

Read Sect. 8 to page 40.
Due Wed. 3/6 (for discussion):
Do Sect. 8: # 1 for (A,G), (B,C), and (D,E); # 4.
Also, review for
Test I.

HOMEWORK VII

For Mon. 3/11:

Read Sect. 9 and the following parts of Sect. 11:
"The minimum connector problem" (to the proof of Theorem 11.1, inclusive) and "Enumeration of chemical molecules".
Due Wed. 3/13 (for discussion):
Do ## B1, B2; and Sect. 9: ## 3, 4, 6, 7(i-iv).
Due Thurs. 3/14 (for discussion):
Do # B3; and Sect. 9: ## 8(i), 10(i); and Sect. 11: ## 1, 3, 4(i), 7.
Hand in Mon. 3/18:
Sect. 9: ## 2, 5, 7(v), 8(ii), 9; and # 11.2.

Problem Set B

  1. Find all unlabelled trees (that means: isomorphic trees are considered to be the same) on n vertices for n = 1, 2, ..., 5.

  2. Find a cycle in the Petersen graph by using the method of Lemma 6.1 . This means to go through the details of the proof of the lemma, using the method (not in a clever way) to eventually wind up with a cycle.

  3. Prove: Proposition. A forest is a simple graph.

HOMEWORK VIII

For Mon. 3/18:

Read Sects. 10 and 12, and (optional; interesting for computer science) Sect. 11 ``Searching trees''.
Due Thurs. 3/21:
Do Sect. 10 ## 2(i) (and also go backwards: from the tree to the sequence, as a check), 2(ii) (and also go backwards: from the sequence to the tree, as a check), 3, 4; Sect. 12 ## 2-4, 6, 7.
Due Fri. 3/22:
Do # C1; Sect. 10 # 6; Sect. 12 ## 5(i), 8, 9, 10(K4,3).
I will go over the test today, as time permits.
Hand in Wed. 4/3:
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.)

  1. Hamiltonicity:
    1. Show that H has a unique Hamiltonian cycle.
    2. Find all edges e such that H-e has no Hamiltonian cycle.

  2. Planarity:
    1. Decide whether H is planar.
    2. 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.
Graph H

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

  1. 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.) Graph G

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.
EXTRA! Do # E7.

Problem Set E

  1. Deduce the vertex Menger's theorem 28.2 from the edge Menger's theorem 28.1. (NOTE: This problem seems to be a mistake.)

  2. Deduce the undirected edge Menger's theorem 28.1 from the directed edge Menger's theorem 28.5.

  3. 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.
    1. Deduce Theorem 28.7 from Theorem 28.5.
    2. Deduce Theorem 28.2 from Theorem 28.7.
    3. Verify Theorem 28.7 for each digraph in Figure 28.7.


  4. Find the chromatic number of the following graph.
    Graph

  5. Let G be a simple graph of order n >= 3 having m edges.
    1. Prove that cr(G) >= m - 3(n-2).
    2. If G has no triangles, then cr(G) >= m - 2(n-2).


  6. Let H = Kr,r - M where M is the edge set { xiyi : i = 1, 2, ..., r }.
    1. Find out as much as you can about the thickness t(H).
    2. Also find out as much as you can about cr(H).
    I suggest that you start with small values of r.

  7. 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.