Every connected balanced -free bipartite graph with minimum degree at least c contains a connected k-factor.

Aug 8, 2018 · Title:Connected k-factors in bipartite graphs. Authors:Yandong Bai, Binlong Li. View a PDF of the paper titled Connected $k$-factors in ...

Jan 1, 2023 · In this paper, we show that, for any two positive integers k, ℓ with 2 ⩽ k ⩽ ℓ, there exists a constant c = c ( k, ℓ ) such that every connected ...

May 19, 2020 · Since every vertex of G has degree k in each k factor, and the k-factors are disjoint (this is a requirement for k-factorization), it follows ...

We prove the following: Let G be connected balanced bipartite graph of order 2n≥4. If G satisfies the localization condition |N 2 (u)∖N(v)|+2≤d(u) for any u,v∈V ...

We show that every connected bipartite biclaw-free graph with minimum degree delta greater-than-or-equal-to 6 has connectivity at least delta - 2 and that every ...

Aug 9, 2018 · I'd like to prove: If |N1(X)|+|N2(X)|+...+|Nk(X)|≥k|X| for every set X⊆A then G has a k - factor.

Nov 17, 2022 · In this paper, we provide spectral conditions for a (balanced bipartite) graph with minimum degree δ to be k-extendable, and for the existence ...

In this paper, a sufficient condition for a balance bipartite graph to have a connected [1, k]-factor is given, which generalizes a known condition of a ...

In this paper, we show that, for any two positive integers k , ℓ with 2 ⩽ k ⩽ ℓ , there exists a constant c = c ( k , ℓ ) such that every connected balanced S ...