Abstract
The class of cubic graphs provides a convenient “laboratory” for studying Hamiltonicity. This is because the Hamiltonian cycle problem is already NP-complete for this class and because there is freely available, reliable, software for enumerating all connected cubic graphs with N vertices (see, for example, Meringer [77]). This offers an opportunity to study the whole populations of these graphs with the goal of understanding the special nature of those members of that population that correspond to non-Hamiltonian graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Borkar, V.S., Ejov, V., Filar, J.A., Nguyen, G.T. (2012). Self-similar Structure and Hamiltonicity. In: Hamiltonian Cycle Problem and Markov Chains. International Series in Operations Research & Management Science, vol 171. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3232-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3232-6_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3231-9
Online ISBN: 978-1-4614-3232-6
eBook Packages: Business and EconomicsBusiness and Management (R0)