Article
The Hamiltonian index of graphs
Discrete Mathematics
Document Type
Article
Publication Date
1-1-2009
Disciplines
DOI
http://dx.doi.org/10.1016/j.disc.2007.12.105
Abstract
The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph H ̃ ( m ) ( G ) from G and prove that if h ( G ) ≥ 2 , then h ( G ) = min{ m : H ̃ ( m ) ( G ) has a spanning Eulerian subgraph }.
Rights
This is a pre-print version of this article. The version of record is available at Elsevier.
NOTE: this version of the article is pending revision and may not reflect the changes made in the final, peer-reviewed version.
Citation Information
Yi Hong, Jian-Liang Lin, Zhi-Sui Tao and Zhi-Hong Chen. "The Hamiltonian index of graphs" Discrete Mathematics Vol. 309 Iss. 1 (2009) p. 288 - 292 Available at: http://works.bepress.com/zhi_hong_chen/8/