Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, 69–81), O. Ore (Amer. Math. Monthly, 67 1960, 55), and Geng-hua Fan (J. Combin. Theory Ser. B, 37 1984, 221–227) for a graph to be hamiltonian are obtained. It is proved, in particular, that a connected graph G on p ≥ 3 vertices is hamiltonian if d(u) ≥ | M3(u)|/2 for each vertex u in G, where M3(u) is the set of vertices v in G that are a distance at most three from u
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
AbstractTheorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), ...
AbstractTheorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), ...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
AbstractDirac proved that if each vertex of a graph G of order n⩾3 has degree at least n/2, then the...
AbstractLet G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of ord...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
AbstractTheorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), ...
AbstractTheorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), ...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
AbstractDirac proved that if each vertex of a graph G of order n⩾3 has degree at least n/2, then the...
AbstractLet G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of ord...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
DOI
Add to ORKG