This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Planar graph theory | |
|---|---|
| Name | Planar graph theory |
| Field | Mathematics |
| Subfield | Graph theory |
| Notable figures | Kurt Gödel, Kazimierz Kuratowski, Karl Menger, Klaus Wagner, William Rowan Hamilton, Leonhard Euler, Arthur Cayley, Paul Erdős, Claude Shannon, Alfred Kempe, Percy John Heawood, Philip Hall, W. T. Tutte, Kőnig (Dénes Kőnig), John Conway, Richard J. Lipton, Robert Endre Tarjan, Michael O. Rabin, Jack Edmonds, Neil Robertson, Paul D. Seymour, Robin Thomas, Noga Alon, László Lovász, Donald E. Knuth, Václav Chvátal, Endre Szemerédi, David Gale, George Pólya, Ettore Majorana, H. S. M. Coxeter, J. H. Conway, Simon Newcomb, Harary (Frank Harary), S. R. Finch, Miklós Bóna, Jaroslav Nešetřil, Paul Turán, Andrásfai (Andrásfai) |
Planar graph theory Planar graph theory studies graphs that can be drawn on the plane without edge crossings, connecting classical results with combinatorics, topology, and algorithms. It links foundational mathematicians and institutions through theorems about embeddings, minors, and algorithmic recognition, and underpins applications in network design, computational geometry, and theoretical computer science.
A planar graph is a graph embeddable in the plane; vertices map to points and edges to nonintersecting arcs. Important concepts include planar embedding, maximal planar graphs (triangulations), connectivity (2-connected, 3-connected), and duality between planar graphs and their geometric duals. Results relate vertex degree and edge count bounds (sparse structure) and connect to triangulations studied by William Rowan Hamilton, Arthur Cayley, Leonhard Euler, and Percy John Heawood in combinatorial enumeration and map problems.
Kuratowski's theorem characterizes planarity via forbidden subdivisions (homeomorphic copies) of Kazimierz Kuratowski's two obstructions, while Wagner's theorem gives an equivalent characterization via minors as established by Klaus Wagner. Both theorems tie into the broader Graph minor theory program of Neil Robertson and Paul D. Seymour and relate to structural results developed by Robin Thomas and collaborators. These characterizations influenced algorithmic testing methods credited to Robert Endre Tarjan and Michael O. Rabin.
Euler's formula V - E + F = 2 for connected planar embeddings, first used by Leonhard Euler, constrains planar graphs and leads to corollaries such as edge bounds and existence of low-degree vertices. Face structure in embeddings links to dual graphs, map colorings, and the four-color problem historically associated with Francis Guthrie, Alfred Kempe, Percy John Heawood, Kenneth Appel, and Wolfgang Haken. Higher-genus generalizations connect to surfaces studied by Henri Poincaré and H. S. M. Coxeter.
Algorithmic recognition of planar graphs was advanced by linear-time algorithms from Robert Endre Tarjan and John Hopcroft and improved via data structures influenced by Donald E. Knuth and Richard J. Lipton. Algorithms include depth-first search based planarity tests, embeddding construction, and incremental planarization used in graph drawing and VLSI layout problems examined by Claude Shannon and Jack Edmonds. Modern algorithmic graph minor tools come from Neil Robertson, Paul D. Seymour, and complexity results connect to work by Richard M. Karp and Stephen Cook.
The concept of minors central to Robertson–Seymour theory classifies graphs by excluded minors; planar graphs are characterized by the finite set {the two Kuratowski obstructions}. The graph minor theorem of Neil Robertson and Paul D. Seymour implies well-quasi-ordering under the minor relation and has implications pursued by Noga Alon, László Lovász, Endre Szemerédi, and Paul Erdős in extremal graph theory and parameterized complexity. Forbidden minor characterization guides decomposition theorems attributed to teams including Robin Thomas and Paul D. Seymour.
Planar graph concepts inform computational geometry (triangulations, planar separators), geographic information systems studied by William Rowan Hamilton analogs, network routing engineered in work by Claude Shannon and Donald E. Knuth, and graph drawing standards influenced by Robert Endre Tarjan and Richard J. Lipton. Variants include outerplanar graphs, series-parallel graphs, and 1-planar graphs connected to studies by Paul Erdős, Frank Harary, Jaroslav Nešetřil, and Miklós Bóna. Separator theorems due to Irit Dinur and Gary Miller and spectral methods from László Lovász and Fan Chung have algorithmic impact; parameterized algorithms derive from research by Downey (Rodney G. Downey) and Michael R. Fellows.
Origins trace to combinatorial work by Leonhard Euler, map-coloring questions from Francis Guthrie, and 19th-century topology influenced by Henri Poincaré and Kurt Gödel's contemporaries. The 20th century saw formalization by Kazimierz Kuratowski, further structural theory by Klaus Wagner, and major algorithmic advances by John Hopcroft, Robert Endre Tarjan, Michael O. Rabin, and the later Robertson–Seymour series led by Neil Robertson and Paul D. Seymour. The four-color theorem resolution by Kenneth Appel and Wolfgang Haken and subsequent refinements involved long collaborations across institutions such as Princeton University, University of Cambridge, and Bell Labs.