The theorem on planar graphs

DOI10.1016/0315-0860(85)90045-XMaRDI QIDQ1071005zbMATH OpenOpenAlexWikidataFDO

Authors John W. Kennedy, Louis V. Quintas, Maciej M. Sysło

Publication date 1985

Published in Historia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0315-0860(85)90045-x

zbMATH Keywords

K. MengerL. S. PontrjaginO. FrinkP. A. Smith

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of combinatorics (05-03)

Review text

In 1930 \textit{K. Kuratowski} published a proof of the Theorem on planar graphs: A graph is planar if and only if it does not contain a subgraph homeomorphic to either \(K_ 5\) (the complete graph on 5 points), or \(K_{3,3}\) (the complete bipartite graph on 3,3 points). The authors tell the history of the discovery of the theorem and its proof, in which other mathematicians like O. Frink, P. A. Smith, L. S. Pontrjagin and K. Menger are involved. The authors clarify to what extent the attachment of Pontrjagin's name to this theorem is justified.

Recommendations

• A theorem on paths in planar graphs
• A theorem on graphs
• A structural theorem for planar graphs with some applications
• Planar graphs: Theory and algorithms
• On almost-planar graphs
• The Gallai-Younger conjecture for planar graphs
• Planar graphs on the projective plane
• Farber's conjecture for planar graphs
• scientific article; zbMATH DE number 1019602
• A planarity criterion for graphs

Cites work

• A dual form of Kuratowski’s theorem
• A new planarity criterion for 3-connected graphs
• A Survey of Progress in Graph Theory in the Soviet Union
• A SURVEY OF PROGRESS IN GRAPH THEORY IN THE SOVIET UNION*
• Concept of a vertex in a matroid and 3-connected graphs
• Frequently cited publications in pure graph theory
• Graph theory
• Homage to the memory of kazimierz kuratowski
• scientific article; zbMATH DE number 3160790 (Why is no real title available?)
• scientific article; zbMATH DE number 3817743 (Why is no real title available?)
• scientific article; zbMATH DE number 3683519 (Why is no real title available?)
• scientific article; zbMATH DE number 3728286 (Why is no real title available?)
• scientific article; zbMATH DE number 3745246 (Why is no real title available?)
• scientific article; zbMATH DE number 3777537 (Why is no real title available?)
• scientific article; zbMATH DE number 3523580 (Why is no real title available?)
• scientific article; zbMATH DE number 3547241 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 7273777 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3338382 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• scientific article; zbMATH DE number 3394154 (Why is no real title available?)
• Kuratowski's theorem
• Kuratowski-Pontrjagin theorem on planar graphs
• On the origin of then-arc theorem
• THE FOUR COLOR PROBLEM

Cited in

(8)

• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• An exercise in mathematical engineering: stating and proving Kuratowski theorem
• International mathematical journals published in Poland between the Wars
• scientific article; zbMATH DE number 3987296 (Why is no real title available?)
• scientific article; zbMATH DE number 4097406 (Why is no real title available?)
• scientific article; zbMATH DE number 4198022 (Why is no real title available?)
• On the Fundamental Problem of Mathematics
• Domination complement tree graphs

This page was built for publication: The theorem on planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071005)