✦ LIBER ✦

OnK1,k-factorization of bipartite multigraphs

✍ Scribed by Jian Wang

Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2008
Tongue: English
Weight: 145 KB
Volume: 23
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-008-1850-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The spectrum of path factorization of bi

The spectrum of path factorization of bipartite multigraphs

✍ Jian Wang; Bei-liang Du 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 225 KB

K1,k-factorization of bipartite graphs

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

Bipartite multigraphs with 1-factors con

Bipartite multigraphs with 1-factors containing specified edges

✍ S. M. Allen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract We prove a necessary and sufficient condition for a regular bipartite multigraph to contain a 1‐factor including one specified set of independent edges and avoiding another specified set of edges. © 1995 John Wiley & Sons, Inc.

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

An extension of bipartite multigraphs

✍ D. De Werra 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Usual edge colorings have been generalized in various ways; we wilI consider here essentially good edge colorings as well as equitable edge colorings. It is known that bipartite multigraphs present the property of having an equitable k-coloring for each k 3 2. This implies that they also have a good