✦ LIBER ✦

Unextendible product bases and 1-factorization of complete graphs

✍ Scribed by Keqin Feng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

P4k-1-factorization of complete bipartit

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

A 1-factorization of the line graphs of

✍ Brian Alspach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

K1,pk-factorization of complete bipartit

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

K1,p2-factorization of complete bipartit

✍ B. Du 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 242 KB

On 4-semiregular 1-factorizations of com

✍ Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 304 KB

Factorizations of the Complete Graph int

✍ Peter Adams; Darryn Bryant; Saad I. El-Zanati; Heather Gavlas 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 347 KB