Constructing indecomposable 1-factorizations of the complete multigraph

DOI10.1016/0012-365X(91)90262-ZzbMath0754.05054WikidataQ114215623 ScholiaQ114215623MaRDI QIDQ1182917

Jeffrey H. Dinitz, Dan S. Archdeacon

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete multigraphsindecomposable 1-factorizations

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

One‐factorizations of complete multigraphs and quadrics in PG(n,q) ⋮ Indecomposable 1‐factorizations of the complete multigraph for every ⋮ 1-factorizations of complete multigraphs arising from finite geometry ⋮ New constructions of simple and indecomposable 1-factorizations of complete multigraphs

Cites Work

• Unnamed Item

This page was built for publication: Constructing indecomposable 1-factorizations of the complete multigraph