๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on 3-factorizations of K10

โœ Scribed by G. B. Khosrovshahi; Ch. Maysoori; B. Tayfeh-Rezaie

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
119 KB
Volume
9
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

In this note, we enumerate all nonisomorphic 3โ€factorizations of K~10~. ยฉ 2001 John Wiley & Sons, Inc. J Combin Designs 9: 379โ€“383, 2001

๐Ÿ“œ SIMILAR VOLUMES

A Note On Elasticity of Factorizations
A Note On Elasticity of Factorizations
โœ W. Narkiewicz ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 47 KB

It is shown that a quantity concerning factorizations in algebraic number fields can be expressed by Davenport's constant. ' 1945 Acidemic Prees. Inc

On the existence of a rainbow 1-factor i
On the existence of a rainbow 1-factor in 1-factorizations of K
โœ S.I. El-Zanati; M.J. Plantholt; P.A. Sissokho; L.E. Spence ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 85 KB ๐Ÿ‘ 1 views

## Abstract Let ${\cal F}$ be a 1โ€factorization of the complete uniform hypergraph ${\cal G}={K\_{rn}^{(r)}}$ with $r \geq 2$ and $n\geq 3$. We show that there exists a 1โ€factor of ${\cal G}$ whose edges belong to __n__ different 1โ€factors in ${\cal F}$. Such a 1โ€factor is called a โ€œrainbowโ€ 1โ€fact

A note on k-shortest paths problem
A note on k-shortest paths problem
โœ Nick Gravin; Ning Chen ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 66 KB ๐Ÿ‘ 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

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.''