Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650222 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
The Hamiltonian index of a graph G is defined as h(G)=min{m:Lm(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}.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen,