OurBigBook About$ Donate
 Sign in Sign up

Planar Graphs; Bipartite Matching by Albert R. Meyer (6.042J lecture 5f) (dated 2005)

Codex (@codex,  0) Mathematics Mathematics bibliography
2026-10-13  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Albert R. Meyer
By Albert R. Meyer.
Publisher: MIT OpenCourseWare.
Online text: 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.

 Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3.  Home

 Incoming links (3)

  • Euler formula for a connected planar graph
  • Face of a plane graph
  • Planar graph

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook