✦ LIBER ✦

The number of 4-cycles in 2-factorizations of K2n minus a 1-factor

✍ Scribed by Peter Adams; Elizabeth J. Billington; I.J. Dejter; C.C. Lindner

Book ID: 108316448
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 109 KB
Volume: 220
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00377-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of 1-factors in 2k-connected

The number of 1-factors in 2k-connected graphs

✍ Béla Bollobas 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Common prime factors of the numbers(A_n

Common prime factors of the numbers(A_n = a^{2^n } + 1)

✍ Hans Riesel 📂 Article 📅 1969 🏛 Springer Netherlands 🌐 English ⚖ 256 KB

The number of cycles in 2-factors of cub

The number of cycles in 2-factors of cubic graphs

✍ Moshe Rosenfeld 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 758 KB

On the existence of rainbows in 1-factor

On the existence of rainbows in 1-factorizations of K2n

✍ David E. Woolbright; Hung-Lin FU 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

A 1-factor of a graph G = (V, E) is a collection of disjoint edges which contain all the vertices of V . Given a 2n -1 edge coloring of K2n, n ≥ 3, we prove there exists a 1-factor of K2n whose edges have distinct colors. Such a 1-factor is called a ''Rainbow.''

Bounds on the maximum numbers of clear t

Bounds on the maximum numbers of clear two-factor interactions for(2^{(n_1 + n_2 ) - (k_1 + k_2 )} )fractional factorial split-plot designs

✍ Xuemin Zi; Runchu Zhang; Minqian Liu 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 257 KB

The upper bound of the number of cycles

The upper bound of the number of cycles in a 2-factor of a line graph

✍ Jun Fujisawa; Liming Xiong; Kiyoshi Yoshimoto; Shenggui Zhang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

## Abstract Let __G__ be a simple graph with order __n__ and minimum degree at least two. In this paper, we prove that if every odd branch‐bond in __G__ has an edge‐branch, then its line graph has a 2‐factor with at most ${{3n - 2}\over {8}}$ components. For a simple graph with minimum degree at le