AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of sufficiently large order n=n(k), minimum degree conditions that imply the existence of a Hamiltonian cycle C such that the distance on the cycle C between x and y is precisely k will be proved
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, ...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle p...
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle p...
Graph TheoryFor a positive integer n∈ℕ and a set D⊆ ℕ, the distance graph GnD has vertex set {...
For a positive integer n ∈ N and a set D ⊆ N, the distance graph GDn has vertex set {0, 1,..., n − 1...
AbstractFor a finite set D⊆N with gcd(D)=1, we prove the existence of some n∈N such that the distanc...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
AbstractLet G be a graph with n vertices and minimum degree at least n/2, and let d be a positive in...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
We show that in any graph G on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vertices x a...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
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, ...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
AbstractGiven a fixed positive integer k≥2 and a fixed pair of vertices x and y in a graph of suffic...
Let G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theo...
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle p...
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle p...
Graph TheoryFor a positive integer n∈ℕ and a set D⊆ ℕ, the distance graph GnD has vertex set {...
For a positive integer n ∈ N and a set D ⊆ N, the distance graph GDn has vertex set {0, 1,..., n − 1...
AbstractFor a finite set D⊆N with gcd(D)=1, we prove the existence of some n∈N such that the distanc...
AbstractLet G=(V,E) be a 2-connected simple graph and let dG(u,v) denote the distance between two ve...
AbstractLet G be a graph with n vertices and minimum degree at least n/2, and let d be a positive in...
AbstractA Hamiltonian path of a graph G is a simple path that contains each vertex of G exactly once...
We show that in any graph G on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vertices x a...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
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, ...
Theorems on the localization of the conditions of G. A. Dirac (Proc. London Math. Soc. (3), 2 1952, ...
DOI
Add to ORKG