KnowraPlanar graphLinked fromLinked fromThe 37 pages that link to Planar graph, each with the reason it gives.All 37Broader topic 8Related 15Narrower topic 9Compared with 5Four color theoremNarrower topic: Map regions become vertices, and shared boundary segments become edges.Circle packingNarrower topic: Circle tangency patterns correspond to planar graphs.Wagner's theoremNarrower topic: Wagner’s theorem identifies exactly which finite graphs belong to this class.Circle packing theoremNarrower topic: The theorem translates this graph structure into circle tangencies.Fáry's theoremNarrower topic: Fáry's theorem begins with this topological condition and guarantees a straight-line drawing.Five color theoremNarrower topic: The theorem applies precisely to this class of graphs.FKT algorithmNarrower topic: Planarity enables the signing conditions that make the Pfaffian count exact.Grötzsch's theoremNarrower topic: Planarity is the structural condition that makes the three-color bound possible.Three utilities problemNarrower topic: The puzzle asks whether K₃,₃ is planar; it is not.