|
Week
|
Topics
|
Study Metarials
|
|
1
|
Matchings and covers
|
R1- Chapter 3.1
|
|
2
|
Algorithms and applications
|
R1- Chapter 3.2
|
|
3
|
Cuts and connectivity
|
R1- Chapter 4.1
|
|
4
|
k-connected graphs
|
R1- Chapter 4.2
|
|
5
|
Network flow problems
|
R1- Chapter 4.3
|
|
6
|
Vertex colorings and upper bounds
|
R1- Chapter 5.1
|
|
7
|
Structures of k-chromatic graphs
|
R1- Chapter 5.2
|
|
8
|
Counting proper colorings
|
R1- Chapter 5.3
|
|
9
|
Embeddings and Euler?s formula
|
R1- Chapter 6.1
|
|
10
|
Characterization of planar graphs
|
R1- Chapter 6.2
|
|
11
|
Parameters of planarity
|
R1- Chapter 6.3
|
|
12
|
Line graphs and edge-colorings
|
R1- Chapter 7.1
|
|
13
|
Hamiltonian cycles
|
R1- Chapter 7.2
|
|
14
|
Planarity, coloring, and cycles
|
R1- Chapter 7.3
|