A theorem on graphs
From MaRDI portal
Publication:1565255
DOI10.2307/1968197zbMath0002.16101OpenAlexW4237169760WikidataQ56209818 ScholiaQ56209818MaRDI QIDQ1565255
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
Related Items
A new algorithm for embedding plane graphs at fixed vertex locations, Two-page book embeddings of 4-planar graphs, Flip graphs of stacked and flag triangulations of the 2-sphere, The number of defective colorings of graphs on surfaces, A survey on book-embedding of planar graphs, Planar graphs have 1-string representations, $B$-sets and coloring problems, The book thickness of 1-planar graphs is constant, Circumscribing polygons and polygonizations for disjoint line segments, Making triangulations 4-connected using flips, Improved bounds for hypohamiltonian graphs, Recent advances on the Hamiltonian problem: survey III, Discrete Morse theory and the homotopy type of clique graphs, Computation in Causal Graphs, On a subposet of the Tamari lattice, Plane Triangulations Without Spanning 2-Trees, A History of Flips in Combinatorial Triangulations, Triangulating with high connectivity., A Theorem on Planar Graphs, On the number of hamiltonian cycles in a maximal planar graph, Unnamed Item, Criticality of counterexamples to toroidal edge-Hamiltonicity, Metamathematical approach to proving theorems of discrete mathematics, On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations, Rotation Distance, Triangulations, and Hyperbolic Geometry, Structure and pancyclicity of maximal planar graphs with diameter two, COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA, Disjoint paths, planarizing cycles, and spanning walks, Toughness and Delaunay triangulations
