✦ LIBER ✦

Kp,q-factorization of the complete bipartite graph Km,n

✍ Scribed by Jian Wang; Beiliang Du

Book ID: 108113415
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 184 KB
Volume: 283
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.12.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Kp,q-factorization of complete bipartite

Kp,q-factorization of complete bipartite graphs

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

Coverings of the complete (di-)graph wit

Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I

✍ Hans-Dietrich O.F. Gronau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 519 KB

The proof of Ushio’s conjecture concerni

The proof of Ushio’s conjecture concerning path factorization of complete bipartite graphs

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

The isomorphic factorization of complete

The isomorphic factorization of complete tripartite graphs K (m, n, s) - a proof of F. Harary, R.W. Robinson and N.C. Wormald's conjecture

✍ Shihui Yang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Harary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K(m,n,s) if t = 2 or 4 and tl(mn + ms + ns), then G has an isomorphic factorization into t isomorphic subgraphs, written as t[ G. They also proved that the analogous statement is false for all odd t > 1. They conject