Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-connected graph with n vertices and connectivity κ such that d(x) + d(y) + d(z) ≥ n + κ for any triple of independent vertices x, y, z, then G is hamiltonian
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
AbstractUsing a variation of the Bondy-Chvátal closure theorem the following result is proved: If G ...
AbstractLet G be a simple graph of order n with connectivity k⩾2, independence number α. We prove th...
AbstractLet G be a k-connected (k ⩾ 2) graph on n vertices. Let S be an independent set of G. S is c...
AbstractThe well-known closure concept of Bondy and Chvátal (1976) is based on degree sums of pairs ...
AbstractIn this paper, an alternative closure operation to the one introduced in [2] is given. For a...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractBondy and Chvátal have observed the following result: G=(V,E) is a simple graph of order n. ...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractThe well-known closure concept of Bondy and Chvátal is based on degree-sums of pairs of nona...
AbstractWe give a sufficient condition for hamiltonism of a 2-connected graph involving the degree s...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
AbstractUsing a variation of the Bondy-Chvátal closure theorem the following result is proved: If G ...
AbstractLet G be a simple graph of order n with connectivity k⩾2, independence number α. We prove th...
AbstractLet G be a k-connected (k ⩾ 2) graph on n vertices. Let S be an independent set of G. S is c...
AbstractThe well-known closure concept of Bondy and Chvátal (1976) is based on degree sums of pairs ...
AbstractIn this paper, an alternative closure operation to the one introduced in [2] is given. For a...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractBondy and Chvátal have observed the following result: G=(V,E) is a simple graph of order n. ...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractLet G be a graph of order n and α the independence number of G. We show that if G is a 2- co...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractThe well-known closure concept of Bondy and Chvátal is based on degree-sums of pairs of nona...
AbstractWe give a sufficient condition for hamiltonism of a 2-connected graph involving the degree s...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
DOI
Add to ORKG