Polyhedra of small order and their Hamiltonian properties
From MaRDI portal
Publication:1907113
DOI10.1006/jctb.1996.0008zbMath0847.52008OpenAlexW1995722730WikidataQ56001758 ScholiaQ56001758MaRDI QIDQ1907113
Publication date: 8 October 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/224c3732db4005e2eee77d8d1800aca9a4b3252f
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)
Related Items
Self-dual polyhedra of given degree sequence ⋮ On the toughness index of planar graphs ⋮ Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ Unnamed Item ⋮ On polyhedral graphs and their complements ⋮ Combinatorial optimization in geometry ⋮ Longer cycles in essentially 4-connected planar graphs ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian ⋮ On the Circumference of Essentially 4-connected Planar Graphs ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs ⋮ Generating rooted triangulations without repetitions ⋮ Self-polar polytopes ⋮ Generation of simple quadrangulations of the sphere ⋮ Construction of planar triangulations with minimum degree 5
