AbstractAn n-ladder is a balanced bipartite graph with vertex sets A={a,…,an} and B={b1,…,bn} such that ai∼bj iff |i−j|⩽1. We use techniques developed recently by Komlós et al. (1997) to show that if G=(U,V,E) is a bipartite graph with |U|=n=|V|, with n sufficiently large, and the minimum degree of G is at least n/2+1, then G contains an n-ladder. This answers a question of Wang
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
In this article, we consider Vizing\u27s 2-Factor Conjecture which claims that any -critical graph h...
Let G be a 2-connected graph of order n satisfying α(G) = a ≤ κ(G), where α(G) and κ(G) are the inde...
AbstractAn n-ladder is a balanced bipartite graph with vertex sets A={a,…,an} and B={b1,…,bn} such t...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
An H-n-factor of a graph G is defined to be a spanning sub-graph F of G such that each vertex has a ...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
For a set S of connected graphs, a spanning subgraph F of a graph is called an S-factor if every com...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
AbstractLet G be a balanced bipartite graph of order 2n and minimum degree δ(G)⩾3. If, for every bal...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
In this article, we consider Vizing\u27s 2-Factor Conjecture which claims that any -critical graph h...
Let G be a 2-connected graph of order n satisfying α(G) = a ≤ κ(G), where α(G) and κ(G) are the inde...
AbstractAn n-ladder is a balanced bipartite graph with vertex sets A={a,…,an} and B={b1,…,bn} such t...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
The k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycl...
An H-n-factor of a graph G is defined to be a spanning sub-graph F of G such that each vertex has a ...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
AbstractThe set of two-factors of a bipartite k-regular graph, k>2, spans the cycle space of the gra...
For a set S of connected graphs, a spanning subgraph F of a graph is called an S-factor if every com...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
AbstractLet G be a balanced bipartite graph of order 2n and minimum degree δ(G)⩾3. If, for every bal...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
In this article, we consider Vizing\u27s 2-Factor Conjecture which claims that any -critical graph h...
Let G be a 2-connected graph of order n satisfying α(G) = a ≤ κ(G), where α(G) and κ(G) are the inde...
DOI
Add to ORKG