AbstractA graph is strongly path connected if between each pair of distinct vertices there exist paths of all lengths greater than or equal to the distance between the vertices.It is shown that the squares of both bridgeless connected DT-graphs and blocks are strongly path connected. Thus as a corollary both these classes of graphs are Hamiltonian, Hamiltonian-connected, and vertex and edge pancyclic
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are present...
AbstractA graph is strongly path connected if between each pair of distinct vertices there exist pat...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractA graph G is a line-critical block if κ(G) = 2 and if for any line e of G the graph G − e ha...
AbstractLet T = (V, A) be a tournament with p vertices. T is called completely strong path-connected...
AbstractThe graphs considered are connected and bridgeless. For such graphs the existence of two typ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-b...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are present...
AbstractA graph is strongly path connected if between each pair of distinct vertices there exist pat...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractA graph G is a line-critical block if κ(G) = 2 and if for any line e of G the graph G − e ha...
AbstractLet T = (V, A) be a tournament with p vertices. T is called completely strong path-connected...
AbstractThe graphs considered are connected and bridgeless. For such graphs the existence of two typ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joinin...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-b...
AbstractThe square of a path (cycle) is the graph obtained by joining every pair of vertices of dist...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are present...
DOI
Add to ORKG