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 5Graph theoryBroader topic: Planarity links graph structure to geometric embedding and coloring constraints.Simple graphBroader topic: Planarity is a structural property often studied for simple graphs.Graph minorBroader topic: Planarity is characterized by excluding two specific graph minors.Graph embeddingBroader topic: Planarity asks whether a graph embeds in the plane without crossings.Chromatic polynomialBroader topic: The four-color theorem asserts every planar graph has a proper coloring with at most four colors.Planar separator theoremBroader topic: Planarity is the structural assumption that makes the separator bound possible.Burr–Erdős conjectureBroader topic: Every planar graph is 5-degenerate, so the conjecture predicts linear Ramsey growth for this family.Two-dimensional spaceBroader topic: Planar graphs encode relationships constrained by a two-dimensional embedding.