INSTITUTE OF APPLIED MATHEMATICS
Last Updated:
28/08/2017 - 21:10

IAM507 - Algorithmic Graph Theory

Credit: 3(3-0); ECTS: 8.0
Instructor(s): Consent of IAM
Prerequisites: Consent of Instructor(s)

Course Catalogue Description

Basic concepts: Walks, connection, external graphs, search trees, hyper graphs, Hamilton paths. Fundamental Parameters: Connectivity, edge connectivity, stability number, matching number, chromatic number, toughness. Bipartite graphs, line graphs, Thowrason’s lemma, Pora’s lemma, Woodall’s hopping lemma. Lengths of circuits. Packing's and coverings. External graphs. Ramsey theory.

Course Objectives

Course Learning Outcomes

Tentative (Weekly) Outline

Basic concepts: Walks, connection, external graphs, search trees, hyper graphs, Hamilton paths. Fundamental Parameters: Connectivity, edge connectivity, stability number, matching number, chromatic number, toughness. Bipartite graphs, line graphs, Thowrason’s lemma, Pora’s lemma, Woodall’s hopping lemma. Lengths of circuits. Packing's and coverings. External graphs. Ramsey theory.

More Info on METU Catalogue

Back