Graph Theory Lessons

• About the program Petersen
• Download

• Extra Credit Problem!

• Lesson 1: Null graphs
• Lesson 2: Handshaking Lemma
• Lesson 3: Isomorphism
• Lesson 4: Complete Graphs, Subgraphs
• Lesson 5: Regular Graphs
• Lesson 6: Platonic Graphs
• Lesson 7: Adjacency Matrices
• Lesson 8: Graph Coloring
• Lesson 9: Bipartite Graphs
• Lesson 10: Stars and Tripartite Graphs
• Lesson 11: Circuits and Wheels
• Lesson 12: Euler Circuits
• Lesson 13: Trees and Searches
• Lesson 14: Unions and Sums
• Lesson 15: Complements
• Lesson 16: Prisms
• Lesson 17: Laces
• Lesson 18: Line Graphs
• Lesson 19: Grids
• Lesson 20: Spanning Trees
• Lesson 21: Planar Graphs
• Lesson 22: Dual Graphs
• Lesson 23: Weighted Graphs, Shortest Paths, and Minimal Spanning Trees

Project Director: Dr. Christopher P. Mawata Department of Mathematics University of Tennessee at Chattanooga 615 McCallie Avenue Chattanooga, TN 37403-2598 Phone: 423-755-4545 fax: 423-755-4586 e-mail: C. Mawata

* * * * * * * *These pages are optimized for use with the Netscape2.0 and 3.0 family of Web Browsers. Other browsers might have difficulty with exponents in the mathematical expressions.

This page has been hit times since April 8, 1997. © C. Mawata
These lessons were last revised 4/21/98.