Longest Simple Paths in Polyhedral Graphs

DOI10.1112/JLMS/S1-37.1.152MaRDI QIDQ3292139zbMATH OpenOpenAlexFDO

Authors Branko Grünbaum, Theodore S. Motzkin

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

Cited in

(13)

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

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

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