= Planar Graphs; Bipartite Matching by Albert R. Meyer (6.042J lecture 5f)
{c}
{tag=Work by Albert R. Meyer}
{title2=dated 2005}
By <Albert R. Meyer>.
Publisher: MIT OpenCourseWare.
Online text: https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-fall-2005/aa542addc1c3bda6732467fb90723852_slides5f.pdf
Lecture 5f of MIT 6.042J and 18.062J, Mathematics for Computer Science, dated 7 October 2005. Authorship is credited to this slide deck, rather than to every resource in the course.
Cited passages: Planar Graphs; Bipartite Matching, slide lec 5f.6, including the outer face; Planar Graphs; Bipartite Matching, slides lec 5f.14–5f.15; Planar Graphs; Bipartite Matching, slides lec 5f.3 and 5f.12.
Back to article page
