2000 character limit reached
On traceable iterated line graph and hamiltonian path index
Published 28 Dec 2020 in math.CO | (2012.14551v1)
Abstract: Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $Ln(G)$ is hamiltonian, for $n\ge2$. In this paper, we study the existence of a hamiltonian path in $Ln(G)$, and give a characterization of $G$ for which $Ln(G)$ has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.