Algorithmic Graph Theory

Theory and algorithms for solving computational problems in graphs and hypergraphs. The topics may include minimum transversals, maximum matchings, trees and bipartite graphs, chordal graphs, planar graphs and graph coloring, hypertrees, chordal hypergraphs, planar hypergraphs and hypergraph coloring, colorability, perfection, and chromatic spectrum. Prerequisite(s): MTH 2220, MTH 4420, or MTH 5520, or permission of the instructor

Credits

3 credits

Course Code

MTH 6634