Hamiltonian spectra of graphs

DOI10.1007/s00373-019-02035-0zbMath1416.05167OpenAlexW2938989013MaRDI QIDQ2000574

Li-Da Tong, Hao-Yu Yang, Xuding Zhu

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02035-0

zbMATH Keywords

orientationHamiltonian numberHamiltonian spectrum

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Hamiltonian numbers of Möbius double loop networks
• A method in graph theory
• Hamiltonian numbers in oriented graphs
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• The Hamiltonian numbers in digraphs
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• The Hamiltonian Number of Cubic Graphs
• On Hamiltonian Walks in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian spectra of graphs