Graph Theory - MATH 247
Exam 2
Name:
Honor Code Pledge:
Signature:
Directions: Please complete all but 1 problem. There is a time limit of 3 hours.
1.
Given the vertex-labelled tree in Figure 1 determine its Prfer code.
u
Given the following Prfer code
Graph Theory - MATH 247
Exam 2
Name:
Honor Code Pledge:
Signature:
Directions: Please complete all but 1 problem. There is a time limit of 3 hours.
1. Prove that every nontrivial tree has at least two maximal independent sets, with
equality only for stars
Graph Theory - MATH 247 - Spring 08
Exam 1
Name:
Honor Code Pledge:
Signature:
Directions: Please complete all but 1 problem. Each problem is worth 10 points.
Please complete the problems on separate paper and place them in order upon stapling to
this she
Graph Theory MATH 247
Exam 2
Name:
Honor Code Pledge
Signature
Directions: Please complete all but 1 problem. There is a time limit of 2- hours.
1. 0 Given the following tree determine its Prfer code.
3
O _. _ .
g Q;
q
0 Given the following Prfer
MATH 247: Graph Theory
Course Description
Instructor: John Schmitt
Oce: Warner 311, Ext. 5952
E-mail: [email protected]
Oce Hours: Tuesday 1:303pm, Wednesday 910am, Friday 2:454pm and by arrangement
Meeting Times:
Section A, MWF, 1:45pm2:35pm, Warne
Graph Theory - MATH 247
Exam 3
Name:
Honor Code Pledge
Signature
Directions: Please complete all but 1 problem. There is a time limit of 3 hours.
1. Let G be a simple n-vertex graph with vertex degrees d1 d2 . . . dn . Prove
that if dj j + 1 whenever j n
Graph Theory - MATH 247
Exam 3
Name:
Honor Code Pledge
Signature
Directions: Please complete all problems. There is a time limit of 3 hours.
1. Given graphs G and H , you proved (G H ) = (G) + (H ). If G and H are colorcritical is G H also color critical?
Graph Theory - MATH 247 - Fall 11
Exam 1
Name:
Honor Code Pledge:
Signature:
Directions: This exam is a closed-book, closed-notes exam. Please complete all but
1 problem. Each problem is worth 10 points. Please complete the problems on separate
paper and