Linked from

The 37 pages that link to Planar graph, each with the reason it gives.

• Graph coloringRelated: Planarity imposes a famous upper bound of four on the chromatic number.

• Vertex (geometry)Related: In a planar drawing, vertices mark the endpoints and meeting points of edges.

• Euclidean planeRelated: The plane provides the setting for deciding whether a graph admits such a drawing.

• Perfect matchingRelated: Planarity enables special methods for counting perfect matchings.

• DiagonalRelated: Polygon diagonals create additional edges while remaining within the polygon's planar drawing.

• Undirected graphRelated: Planarity is a structural constraint frequently studied for undirected networks.

• Euler's polyhedron formulaRelated: Projecting a polyhedron's edge network onto a plane turns its count into a graph relation.

• Hamiltonian cycleRelated: Hamiltonian-cycle existence remains NP-complete even when restricted to planar graphs.

• Handshaking lemmaRelated: Degree counting combines with face counts to establish planar graph bounds.

• Robertson–Seymour theoremRelated: Planarity exemplifies a property captured by finitely many forbidden minors.

• CoplanarityRelated: Its drawings depend on placing vertices and edges consistently within one plane.

• Edge contractionRelated: Contracting an edge in a planar graph preserves planarity.

• Venn diagramRelated: Curve intersections and the regions they enclose are constrained by planar geometry.

• Graph structure theoremRelated: For excluded minors that force planarity, the structural pieces are close to planar.

• Honeycomb theoremRelated: Cell boundaries form a planar graph, linking local edge counts to global constraints.