IAMINSTITUTE OF APPLIED MATHEMATICS


IAM507

Code IAM507
Name ALGORITHMIC GRAPH THEORY
Credits 3(3-0)
ECTS 8.0
Objective
Content 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.
Outcomes

Back