Read our cookies policy and privacy statement for more information.
×Davis, California•
Fundamental concepts. Planar graphs: Kuratowski's theorem. Packings and coverings. Menger's theorem, representation of cuts, Hamilton graphs, rigid graphs, chordal graphs, graph coloring, graph isomorphism, applications and some algorithms.
Units: 4.0
Hours: Lecture—3 hour(s); Discussion—1 hour(s).