Document Type

Article

Publication Date

2009

Publication Title

Discrete Mathematics

First Page

288

Last Page

292

DOI

http://dx.doi.org/10.1016/j.disc.2007.12.105

Abstract

The Hamiltonian index of a graph GG is defined as h(G)=min{m:Lm(G) is Hamiltonian}.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 sourceH̃^(m)(G) from GG and prove that if h(G)≥2h(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.

Share

COinS