The hamiltonian numbers in digraphs
Authors:
- 22 June 2012
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 25 (4) , 694-701
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Hamiltonian numbers of Möbius double loop networksJournal of Combinatorial Optimization, 2010
- The Hamiltonian Number of Cubic Graphs2008
- An approximation algorithm for the hamiltonian walk problem on maximal planar graphsDiscrete Applied Mathematics, 1983
- An upper bound on the length of a Hamiltonian walk of a maximal planar graphJournal of Graph Theory, 1980
- A method in graph theoryDiscrete Mathematics, 1976
- On Hamiltonian Walks in GraphsSIAM Journal on Computing, 1974
- Reducibility among Combinatorial Problems1972