LESSON PLAN

DEPARTMENT OF MATHEMATICS
FACULTY OF MATHEMATICS AND SCIENCES
UNIVERSTAS NEGERI MALANG
EVEN SEMESTER 2022/2023

A. COURSE DESCRIPTION
1. Name : Graph Theory
2. Code : PMATUM6020
3. Credit/hour semester : 3/3
4. Level : S1
5. Group : Compulsory
6. Pre-quested course : ----
7. Lecturer : Purwanto

B. STANDARD COMPETENCY
Understand the simple graph theory principles and its applications.

C. BASIC COMPTENCES
Be able to describe and to apply simple graph theory principles, in daily life and for other
needs, such as the definition of graph, walks, paths, and cycles, definition of digraph, Eulerian
graphs and digraphs, Hamiltonian graphs and digraphs, path algorithms, connectivity, trees,
planarity, and coloring graphs.
D. TOPICS
1. Definition of Graph
2. Subgraphs and Isomorphism
3. Trees
4. Vertex Colorings
5. Decompositions and Hamilton Cycles
6. Eulerian Circuits
7. A Theorem of Turan
8. Cages
9. Ramsey Theory
10. Magic Graphs and Graceful Trees
11. Conservative Graphs
12. Planar Graphs
13. The Four Color Theorem

1
E. COURSE ACTIVITIES

Lecture
Topics and Referensces Activities Tasks
No.

Graphs and Degrees of Vertices, Lecturing, discussions, Home work, preparing

1
Hartsfield and Ringel, pp.1-13 student presentations for presentation

Subgraphs, Isomorphic Graphs, Lecturing, discussions, Home work, preparing

2 student presentations for presentation
Hartsfield and Ringel, pp.13-17

Trees, Lecturing, discussions, Home work, preparing

3
Hartsfield and Ringel, pp.17-22 student presentations for presentation

Vertex Colorings, Lecturing, discussions, Home work, preparing

4
Hartsfield and Ringel, pp.23-35 student presentations for presentation

Decompositions and Hamilton Lecturing, discussions, Home work, preparing

5 Cycles, student presentations for presentation
Hartsfield and Ringel, pp.35-43
More Decomposition Lecturing, discussions, Home work, preparing
6 Hartsfield and Ringel, pp.43-48 student presentations for presentation

Eulerian Circuits Lecturing, discussions, Home work, preparing

7 Hartsfield and Ringel, pp.49-58 student presentations for presentation

8 Midle semester test

A Theorem of Turan Lecturing, discussions, Home work, preparing

9 Hartsfield and Ringel, pp.70-77 student presentations for presentation

Cages Lecturing, discussions, Home work, preparing

10
Hartsfield and Ringel, pp.77-81 student presentations for presentation

Ramsey Theory Lecturing, discussions, Home work, preparing

11
Hartsfield and Ringel, pp.81-86 student presentations for presentation

Magic Graphs and Graceful Trees Lecturing, discussions, Home work, preparing
12
Hartsfield and Ringel, pp.104-114 student presentations for presentation

Conservative Graphs Lecturing, discussions, Home work, preparing

13
Hartsfield and Ringel, pp.114-124 student presentations for presentation

Planar Graphs Lecturing, discussions, Home work, preparing

14
Hartsfield and Ringel, pp.149-156 student presentations for presentation

The Four Color Theorem Lecturing, discussions, Home work, preparing

15
Hartsfield and Ringel, pp.156-164 student presentations for presentation

16 Final Test

2
F. EVALUATION
Based on the following scores
= paper score
= presentation score
= middle test
= final test

Final grade =

G. REFERENCES
Compulsory:
Hartsfield, N. and Ringel, G. 1994. Pearls in graph theory: a Comprehensive Introduction. San
Diego: Academic Press,
Optional:
Bondy, J.A. and Murty, U.S.R. 2008. Graph Theory. New York: Springer.
Buckley, Fred and Harary, Frank. 1990. Distance in Graphs. New York: Addison Wesley.
Chartrand, Gary and Lesniak, Linda. 1986. Graphs and Digraphs. California: Wadsworth &
Brooks/Cole.
Diestel, R. 2000. Graph theory, second edition. New York: Springer.
Tutte, W.T. 2001. Graph Theory. New York: Cambridge University Press.
Wilson R.J. and Watkins, J.J. 1990. Graphs, an Introductory Approach. New York: John Wiley
and Sons.