A new heuristic for detecting non-Hamiltonicity in cubic graphs
- 26 June 2015
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 64, 283-292
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Genetic Theory for Cubic Graphs2016
- On transition matrices of Markov chains corresponding to Hamiltonian cyclesAnnals of Operations Research, 2014
- On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graphJournal of Global Optimization, 2012
- Polychromatic 4-coloring of cubic bipartite plane graphsDiscrete Mathematics, 2011
- Hamiltonian Cycles, Random Walks, and Discounted Occupational MeasuresMathematics of Operations Research, 2011
- A conjecture on the prevalence of cubic bridge graphsDiscussiones Mathematicae Graph Theory, 2010
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problemAnnals of Operations Research, 2009
- The Traveling Salesman Problem for Cubic GraphsJournal of Graph Algorithms and Applications, 2007
- The Petersen Graph1993
- Mathematical GamesScientific American, 1976