The diameters of some transition graphs constructed from Hamilton cycles

DOI10.1007/S003730200006MaRDI QIDQ1348655zbMATH OpenOpenAlexFDO

Authors Mariko Hagita, Yoshiaki Oda, Katsuhiro Ota

Publication date 14 May 2002

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730200006

zbMATH Keywords

diameterHamilton cyclestransition graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12)

Recommendations

• Hamilton cycles in some vertex-transitive graphs
• Hamilton cycles in dense vertex-transitive graphs
• Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
• On Hamiltonian decomposition embedding and diameter of certain circulant graphs
• On Hamiltonian paths and cycles in sufficiently large distance graphs
• On the structure of the set of cycle lengths in a Hamiltonian graph
• Hamilton cycles and paths in vertex-transitive graphs-current directions
• Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)
• A cycle structure theorem for Hamiltonian graphs
• scientific article; zbMATH DE number 4152419

Cited in

(3)

• Complete transition diagrams of generic Hamiltonian flows with a few heteroclinic orbits
• The Number of Flips Required to Obtain Non-crossing Convex Cycles
• Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter

This page was built for publication: The diameters of some transition graphs constructed from Hamilton cycles

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