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 5Bipartite graphCompared with: Planarity and bipartiteness are distinct properties, though together they constrain possible cycles.Petersen graphCompared with: The Petersen graph cannot be drawn without crossings, despite its small size.Intersection graphCompared with: Planarity constrains drawings of edges, unlike intersection graphs, which constrain represented objects.Conway's thrackle conjectureCompared with: Thrackle drawings permit crossings, unlike planar embeddings.Erdős–Pósa theoremCompared with: Cycles in planar graphs have stronger linear packing-covering bounds than arbitrary graphs.