Useful Links
Mathematics
Graph Theory
1. Introduction to Graph Theory
2. Fundamental Concepts and Types of Graphs
3. Representing Graphs
4. Paths, Walks, and Cycles
5. Graph Traversal
6. Trees and Forests
7. Shortest Path Algorithms
8. Network Flow
9. Graph Coloring
10. Planar Graphs
11. Matchings
12. Advanced Topics in Graph Theory
Planar Graphs
Planarity Concepts
Planar Embeddings
Drawing in the Plane
Crossing-Free Representations
Multiple Embeddings
Faces of Planar Graphs
Bounded and Unbounded Faces
Face Boundaries
Facial Walks
Euler's Formula
Statement (V - E + F = 2)
Proof for Connected Planar Graphs
Extensions to Disconnected Graphs
Corollaries and Applications
Upper Bounds on Edges
Planarity Necessary Conditions
Average Degree Bounds
Characterization of Planar Graphs
Kuratowski's Theorem
Statement
Forbidden Subgraphs (K₅ and K₃,₃)
Graph Subdivisions
Homeomorphic Graphs
Wagner's Theorem
Graph Minors
Minor-Closed Properties
Planarity Testing
Algorithmic Approaches
Linear Time Algorithms
Hopcroft-Tarjan Algorithm
Complexity Analysis
Implementation Considerations
Planar Graph Properties
Dual Graphs
Construction Method
Duality Properties
Self-Dual Graphs
Planar Graph Coloring
Four Color Theorem Applications
Five Color Theorem
Outerplanar Graphs
Definition and Properties
Recognition Algorithms
Previous
9. Graph Coloring
Go to top
Next
11. Matchings