Hamiltonian circuits on the \(n\)-dimensional octahedron
From MaRDI portal
Publication:1843577
DOI10.1016/0095-8956(75)90069-6zbMath0281.05108OpenAlexW1969368048MaRDI QIDQ1843577
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90069-6
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Polytopes and polyhedra (52Bxx)
Related Items (6)
Enumeration of chord diagrams without loops and parallel chords ⋮ Unnamed Item ⋮ Unfolding cubes: nets, packings, partitions, chords ⋮ Weighted locally gentle quivers and Cartan matrices. ⋮ On the Minimum Number of Hamiltonian Cycles in Regular Graphs ⋮ Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs
Cites Work
This page was built for publication: Hamiltonian circuits on the \(n\)-dimensional octahedron
