✦ LIBER ✦

Path-factorizations of complete bipartite multigraphs

✍ Scribed by Nigel Martin

Book ID: 113567636
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 200 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.03.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Excessive factorizations of bipartite mu

Excessive factorizations of bipartite multigraphs

✍ David Cariolaro; Romeo Rizzi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The spectrum of path factorization of bi

The spectrum of path factorization of bipartite multigraphs

✍ Jian Wang; Bei-liang Du 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 225 KB

Degree-bounded factorizations of biparti

Degree-bounded factorizations of bipartite multigraphs and of pseudographs

✍ A.J.W. Hilton 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 881 KB

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

Edge-disjoint Open Trails in Complete Bi

Edge-disjoint Open Trails in Complete Bipartite Multigraphs

✍ Sylwia Cichacz; Agnieszka Görlich 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 135 KB

Indecomposable factorizations of multigr

Indecomposable factorizations of multigraphs

✍ A.H. Baartmans; W.D. Wallis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 592 KB

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.