✦ LIBER ✦

Indecomposable factorizations of multigraphs

✍ Scribed by A.H. Baartmans; W.D. Wallis

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 592 KB
Volume: 78
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90158-1

No coin nor oath required. For personal study only.

✦ Synopsis

A one-factorization of a complete multigraph is called decomposable if some proper subset of the factors also forms a one-factorization of a complete multigraph; otherwise it is indecomposable. Some results on the existence of indecomposable one-factor&ions will be proven.

📜 SIMILAR VOLUMES

Constructing indecomposable 1-factorizat

Constructing indecomposable 1-factorizations of the complete multigraph

✍ Dan Archdeacon; Jeffrey H. Dinitz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 762 KB

Archdeacon, D. and J.H. Dinitz. Constructing indecomposable I-factorizations of the complete multigraph, Discrete Mathematics 92 (1991) 9-19.

1-Factorizations of Complete Multigraphs

1-Factorizations of Complete Multigraphs Arising from Finite Geometry

✍ Gábor Korchmáros; Alessandro Siciliano; Angelo Sonnino 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 91 KB

One-factorizations of complete multigrap

One-factorizations of complete multigraphs and quadrics in PG(n,q)

✍ Gy. Kiss 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

## Abstract A new infinite family of simple indecomposable one‐factorizations of the complete multigraphs is constructed by using quadrics of finite projective spaces. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 139–143, 2002; DOI 10.1002/jcd.997

Factorization of regular multigraphs int

Factorization of regular multigraphs into regular graphs

✍ S. I. El-Zanati; M. J. Plantholt; S. K. Tipnis 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

## Abstract A regular multigraph with maximum multiplicity __r__ and degree __rs__ cannot always be factored into __r s__‐regular simple graphs. It is shown, however, that under general conditions a similar factorization can be achieved if we first allow the addition or deletion of a relatively sma

List edge colourings of some 1-factorabl

List edge colourings of some 1-factorable multigraphs

✍ M. N. Ellingham; Luis Goddyn 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 547 KB

An Asymptotic Version of the Multigraph

An Asymptotic Version of the Multigraph 1-Factorization Conjecture

✍ E. R. Vaughan 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

## Abstract We give a self‐contained proof that for all positive integers __r__ and all , there is an integer such that for all any regular multigraph of order 2__n__ with multiplicity at most __r__ and degree at least is 1‐factorizable. This generalizes results of Perković and Reed (Discrete Ma