AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the hamiltonian index h(G) of a connected graph G (other than a path) is determined. As a consequence, it is shown that if G is homogeneously traceable, then h(G)⩽2
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
AbstractThe n-iterated line graph of a graph G is Ln(G)=L(Ln−1(G)), where L1(G) denotes the line gra...
The aim of this note is to give several sufficient conditions, for some classes of line graphs, to b...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
AbstractVarious sufficient conditions are given, in terms of forbidden subgraphs, that imply a graph...
AbstractLet G be a graph. Then the hamiltonian index h(G) of G is the smallest number of iterations ...
Let G be an undirected and loopless finite graph that is not a path. The smallest integer m such tha...
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...
AbstractA well-known conjecture of Thomassen says that every 4-connected line graph is hamiltonian. ...
AbstractLet G be an undirected graph that is neither a path nor a cycle. Clark and Wormald [L.H. Cla...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
AbstractThe n-iterated line graph of a graph G is Ln(G)=L(Ln−1(G)), where L1(G) denotes the line gra...
The aim of this note is to give several sufficient conditions, for some classes of line graphs, to b...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
AbstractVarious sufficient conditions are given, in terms of forbidden subgraphs, that imply a graph...
AbstractLet G be a graph. Then the hamiltonian index h(G) of G is the smallest number of iterations ...
Let G be an undirected and loopless finite graph that is not a path. The smallest integer m such tha...
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...
AbstractA well-known conjecture of Thomassen says that every 4-connected line graph is hamiltonian. ...
AbstractLet G be an undirected graph that is neither a path nor a cycle. Clark and Wormald [L.H. Cla...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph...
summary:During the last decade, several research groups have published results on sufficient conditi...
DOI
Add to ORKG