6.042J | Fall 2005 | Undergraduate

Mathematics for Computer Science

Lecture Notes

Lecture 13: Planar Graphs; Bipartite Matching

Description:

This resource discusses planar graphs, Euler’s formula, and Bipartite Matching: Hall?s theorem.

Resource Type:
Lecture Notes
pdf
106 kB
Lecture 13: Planar Graphs; Bipartite Matching
Download File

Course Info

Departments
As Taught In
Fall 2005
Level
Undergraduate
Topics
Learning Resource Types
Exam Solutions
Exams
Lecture Notes
Problem Set Solutions
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology