Syllabus

MA61016
Course name	Advanced Graph Theory and Combinatorics
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	{{{semester}}}

Syllabus mentioned in ERP

Prerequisite: Graph Theory and AlgorithmsDefinitions of : Intersection Graphs, Circular-arc Graphs, Interval Graphs, Line graphs of bipartite graphs. Definition of perfect graph, Some Definitions and properties, Perfect Graph Theorem . Perfect and triangulated graphs. Recognizing Triangulated Graphs, Generating a PEO, Testing an Elimination Scheme, Naive Algorithm, Efficient Algorithm, Evolutionary Trees , Triangulated Graphs as Intersection Graphs, Proof that Triangulated Graphs are Perfect, Computing the Minimum Fill In. Chain Graphs, Optimal Linear Arrangement (OLA), Chain Graph Completion (CGC). Algorithms for triangulated graphs and comparability, Characterizations and Recognition Algorithms, comparability graphs. Comparability invariants and Interval graphs. Temporal reasoning and interval algebras.

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources