Title of the course: Graph Theory
Instructors: Prof. John Gimbel, Prof. Tınaz Ekim
Institution: University of Alaska, Boğaziçi University
Dates: 17 -23 August 2026
Prerequisites: Basic notions in graph theory and/or discrete math
Level: Advanced undergraduate and Graduate. Students with no prior knowledge on graphs are encouraged to read Chapters 1, 2.1, 2.2, 3.1 and 3.2 from Gould (see below).
Abstract: Handshaking Lemma, Trees, Degree sequences (Gallai-Erdös condition, Havel-Hakimi Algorithm), Eulerian Graphs, Chinese Postman Problem, Long paths and cycles, Hamiltonian paths, Graph Coloring and Applications, 4-Color Theorem, Planar graphs, Brook’s Theorem, Grötzch-Mycielski Theorem, Cocoloring Problem and the story of Erdös-Gimbel-Ekim path.
Language: EN
Textbook:
* R. Gould, Graph Theory, Chapters 1,2,3,5,6,8: https://www.math.emory.edu/~rg/m531.html  or https://faculty.fiu.edu/~ramsamuj/graphtheory/grap_txt.html
* J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, 1976. Related chapters from: https://www.iro.umontreal.ca/~hahn/IFT3545/GTWA.pdf
* Chartrand, Lesniak, Graphs & Digraphs.