AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
AbstractThe object of this paper is to review the general problem of using degree conditions to dete...
A well known generalisation of Dirac’s theorem states that if a graph G on n ≥ 4k vertices has minim...
AbstractThe following asymptotic result is proved. For everyε>0, and for every positive integerh, th...
AbstractWe show that a graph with minimum degree δ, independence number α≥δ and without isolated ver...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
AbstractFor every graph G, let σ2(G)=min{d(x)+d(y):xy∉E(G)}. The main result of the paper says that ...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
AbstractThe object of this paper is to review the general problem of using degree conditions to dete...
A well known generalisation of Dirac’s theorem states that if a graph G on n ≥ 4k vertices has minim...
AbstractThe following asymptotic result is proved. For everyε>0, and for every positive integerh, th...
AbstractWe show that a graph with minimum degree δ, independence number α≥δ and without isolated ver...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
AbstractFor every graph G, let σ2(G)=min{d(x)+d(y):xy∉E(G)}. The main result of the paper says that ...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
DOI
Add to ORKG