✦ LIBER ✦

K1,k-factorization of bipartite graphs

✍ Scribed by Du Beiliang

Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1997
Tongue: English
Weight: 201 KB
Volume: 12
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-997-0052-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

K1,pk-factorization of complete bipartit

K1,pk-factorization of complete bipartite graphs

✍ Du Beiliang 📂 Article 📅 2001 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 152 KB

On K1,k-factorizations of a complete bip

On K1,k-factorizations of a complete bipartite graph

✍ Hong Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 311 KB

We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.

OnK1,k-factorization of bipartite multig

OnK1,k-factorization of bipartite multigraphs

✍ Jian Wang 📂 Article 📅 2008 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 145 KB

P4k−1-factorization of bipartite multigr

P4k−1-factorization of bipartite multigraphs

✍ Jian Wang; Beiliang Du 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 206 KB

k-regular factors and semi-k-regular fac

k-regular factors and semi-k-regular factors in bipartite graphs

✍ Keiko Kotani 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 418 KB

Connected [k, k + 1]-factors of graphs

✍ Mao-cheng Cai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are