Graph Theory Reference

Discrete Math · Axiom Academy

FORMULA SHEET Graph Theory Reference Complete reference for graph terminology, algorithms, and fundamental theorems Complexity: with binary heap, with Fibonacci heap Complexity: where is inverse Ackermann function For a connected planar graph with v vertices, e edges, and f faces A graph is planar if and only if it does not contain a subdivision of or A bipartite graph has a complete matching from X to Y if and only if: Every planar graph can be properly colored with at most 4 colors

This is the written version of the interactive lesson above. See the full Discrete Math course.