Simple paths on polyhedra

DOI10.2140/PJM.1963.13.629zbMath0115.41001OpenAlexW2051101987WikidataQ55920126 ScholiaQ55920126MaRDI QIDQ2625677

John W. Moon

Publication date: 1963

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1963.13.629

Mathematics Subject Classification ID

Combinatorics (05-XX)

Related Items (36)

Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ 5-Connected Toroidal Graphs are Hamiltonian-Connected ⋮ The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Polytopes, graphs, and complexes ⋮ Planar Turán numbers of cycles: a counterexample ⋮ On the structure of essentially-highly-connected polyhedral graphs ⋮ An upper bound on the shortness exponent of inscribable polytopes ⋮ Tutte cycles in circuit graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ On 3‐polytopes with non‐Hamiltonian prisms ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Largest 4‐connected components of 3‐connected planar triangulations ⋮ Planar Turán number of the disjoint union of cycles ⋮ Convex polytopes with convex nets ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ A note on 3-connected cubic planar graphs ⋮ On the number of hamiltonian cycles in a maximal planar graph ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ An upper bound on the length of a Hamiltonian walk of a maximal planar graph ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ 2- and 3-factors of graphs on surfaces ⋮ Unnamed Item ⋮ On polyhedral realization with isosceles triangles ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Facets and nonfacets of convex polytopes ⋮ Shortness exponents of families of graphs ⋮ Unnamed Item ⋮ Spanning trees in 3-connected K3,t-minor-free graphs ⋮ Long cycles in graphs on a fixed surface ⋮ Long cycles in 3-connected graphs ⋮ Unnamed Item ⋮ 4-connected projective-planar graphs are Hamiltonian-connected ⋮ An upper bound on the shortness exponent of 1-tough, maximal planar graphs

This page was built for publication: Simple paths on polyhedra