Self-similar Structure and Hamiltonicity

Vivek S. Borkar (), Vladimir Ejov (), Jerzy A. Filar () and Giang T. Nguyen ()
Additional contact information
Vivek S. Borkar: IIT, Powai
Vladimir Ejov: Flinders University
Jerzy A. Filar: Flinders University
Giang T. Nguyen: Université libre de Bruxelles

Chapter Chapter 9 in Hamiltonian Cycle Problem and Markov Chains, 2012, pp 163-178 from Springer

Abstract: 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.

Keywords: Regular Graph; Homotopy Class; Closed Geodesic; Dominant Term; Petersen Graph (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-3232-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461432326

DOI: 10.1007/978-1-4614-3232-6_9

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().