The hamiltonian index of a graph $G$ is the smallest integer $k$ such that the $k$-th iterated line graph of $G$ is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to prove that neither the contraction of an $A_G(F)$-contractible subgraph $F$ of a graph $G$ nor the closure operation performed on $G$ (if $G$ is claw-free) affects the value of the hamiltonian index of a graph $G$
AbstractWe study the stability of some classes of claw-free graphs defined in terms of forbidden sub...
AbstractIn this paper we show that the problem to decide whether the hamiltonian index of a given gr...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
The hamiltonian index of a graph G is the smallest integer k such that the k-th iterated line graph...
Let G be an undirected and loopless finite graph that is not a path. The smallest integer m such tha...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the...
AbstractThe Hamiltonian index of a graph G is defined as h(G)=min{m:Lm(G) is Hamiltonian}. In this p...
We prove that a k-connected graph (k>2) is Hamiltonian if it is not contractible to one of a specifi...
AbstractWe prove that a k-connected graph (k⩾2) is Hamiltonian if it is not contractible to one of a...
AbstractThe n-iterated line graph of a graph G is Ln(G)=L(Ln−1(G)), where L1(G) denotes the line gra...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian ifthe removal of any $k\l...
It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by ...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractWe study the stability of some classes of claw-free graphs defined in terms of forbidden sub...
AbstractIn this paper we show that the problem to decide whether the hamiltonian index of a given gr...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
The hamiltonian index of a graph G is the smallest integer k such that the k-th iterated line graph...
Let G be an undirected and loopless finite graph that is not a path. The smallest integer m such tha...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the...
AbstractThe Hamiltonian index of a graph G is defined as h(G)=min{m:Lm(G) is Hamiltonian}. In this p...
We prove that a k-connected graph (k>2) is Hamiltonian if it is not contractible to one of a specifi...
AbstractWe prove that a k-connected graph (k⩾2) is Hamiltonian if it is not contractible to one of a...
AbstractThe n-iterated line graph of a graph G is Ln(G)=L(Ln−1(G)), where L1(G) denotes the line gra...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian ifthe removal of any $k\l...
It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by ...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractWe study the stability of some classes of claw-free graphs defined in terms of forbidden sub...
AbstractIn this paper we show that the problem to decide whether the hamiltonian index of a given gr...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...