A theorem on graphs

DOI10.2307/1968197MaRDI QIDQ1565255zbMATH OpenOpenAlexWikidataFDO

Authors Hassler Whitney

Publication date 1931

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1968197

zbMATH Keywords

topology

Recommendations

• scientific article; zbMATH DE number 3241107
• scientific article; zbMATH DE number 3843768
• scientific article; zbMATH DE number 3891400
• scientific article; zbMATH DE number 3912383
• Graph theory of four-colors -- existence and searching method of the solution of the four-color problem

Cited in

(35)

• Criticality of counterexamples to toroidal edge-Hamiltonicity
• scientific article; zbMATH DE number 1890144 (Why is no real title available?)
• Disjoint paths, planarizing cycles, and spanning walks
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• $B$-sets and coloring problems
• The number of defective colorings of graphs on surfaces
• On a subposet of the Tamari lattice
• Metamathematical approach to proving theorems of discrete mathematics
• Recent advances on the Hamiltonian problem: survey III
• scientific article; zbMATH DE number 179278 (Why is no real title available?)
• Triangulating with high connectivity.
• Discrete Morse theory and the homotopy type of clique graphs
• Flip graphs of stacked and flag triangulations of the 2-sphere
• A new algorithm for embedding plane graphs at fixed vertex locations
• Structure and pancyclicity of maximal planar graphs with diameter two
• Two-page book embeddings of 4-planar graphs
• Circumscribing polygons and polygonizations for disjoint line segments
• A history of flips in combinatorial triangulations
• A survey on book-embedding of planar graphs
• Toughness and Delaunay triangulations
• A Theorem on Sum Graphs
• Two theorems on graphs
• Planar graphs have 1-string representations
• scientific article; zbMATH DE number 7559209 (Why is no real title available?)
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Plane Triangulations Without Spanning 2-Trees
• Computation in causal graphs
• Coloring planar graphs via colored paths in the associahedra
• The theorem on planar graphs
• On a theorem of Cvetković in graph theory
• scientific article; zbMATH DE number 908762 (Why is no real title available?)
• Improved bounds for hypo-Hamiltonian graphs
• On the number of hamiltonian cycles in a maximal planar graph
• A Theorem on Planar Graphs
• Making triangulations 4-connected using flips

This page was built for publication: A theorem on graphs

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