AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the minimum degree and κ the point connectivity of G
Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Z...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractIn this paper, an alternative closure operation to the one introduced in [2] is given. For a...
Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-c...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is ham...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Z...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractIn this paper, an alternative closure operation to the one introduced in [2] is given. For a...
Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-c...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is ham...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractMatthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order ...
AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Z...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
DOI
Add to ORKG