✦ LIBER ✦

On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs

✍ Scribed by Midori Kobayashi; Gisaku Nakamura

Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 304 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01202470

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unbalanced Star-Factorizations of Comple

Unbalanced Star-Factorizations of Complete Bipartite Graphs II

✍ Nigel Martin 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 188 KB

Ck-factorization of complete bipartite g

Ck-factorization of complete bipartite graphs

✍ Hikoe Enomoto; Takashi Miyamoto; Kazuhiko Ushio 📂 Article 📅 1988 🏛 Springer Japan 🌐 English ⚖ 141 KB

Cube factorizations of complete graphs

✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor

Hall parameters of complete and complete

Hall parameters of complete and complete bipartite graphs

✍ M. M. Cropper; A. J. W. Hilton 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract Given a graph __G__, for each υ ∈__V__(__G__) let __L__(υ) be a list assignment to __G__. The well‐known choice number __c__(__G__) is the least integer __j__ such that if |__L__(υ)| ≥__j__ for all υ ∈__V__(__G__), then __G__ has a proper vertex colouring ϕ with ϕ(υ) ∈ __L__ (υ) (∀υ ∈__

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.

P3-Factorization of complete bipartite g

P3-Factorization of complete bipartite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 344 KB

P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.