Longest Simple Paths in Polyhedral Graphs

DOI10.1112/jlms/s1-37.1.152zbMath0106.16802OpenAlexW2091856136MaRDI QIDQ3292139

Theodore S. Motzkin, Branko Grünbaum

Publication date: 1962

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-37.1.152

zbMATH Keywords

topology

Related Items (13)

Graphs of polyhedra; polyhedra as graphs ⋮ Polytopes, graphs, and complexes ⋮ Treetopes and their graphs ⋮ Regular separable graphs of minimum order with given diameter ⋮ Graphs of maximum diameter ⋮ Longest cycles in polyhedral graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Facets and nonfacets of convex polytopes ⋮ The \(d\)-step conjecture for polyhedra of dimension \(d<6\) ⋮ A simple 4-dimensional nonfacet ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION ⋮ Longest cycles in 3-connected cubic graphs

This page was built for publication: Longest Simple Paths in Polyhedral Graphs