The Hamiltonian numbers in digraphs

DOI10.1007/s10878-012-9512-9zbMath1291.90276OpenAlexW2006924088MaRDI QIDQ1956235

Li-Da Tong, Ting-Pang Chang

Publication date: 13 June 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9512-9

zbMATH Keywords

orientationHamiltonian numberHamiltonian spectrum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ On the Hamiltonian number of a plane graph ⋮ Hamiltonian numbers in oriented graphs ⋮ Hamiltonian spectra of graphs

Cites Work

• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Hamiltonian numbers in digraphs