Hamiltonian numbers in oriented graphs

DOI10.1007/s10878-017-0141-1zbMath1374.05147OpenAlexW2620077531MaRDI QIDQ1679516

Hao-Yu Yang, Li-Da Tong

Publication date: 9 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0141-1

zbMATH Keywords

digraphorientationHamiltonian number

Mathematics Subject Classification ID

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

Related Items (1)

Hamiltonian spectra of graphs

Cites Work

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

This page was built for publication: Hamiltonian numbers in oriented graphs