On the Alspach Conjecture
From MaRDI portal
Publication:2726708
DOI10.1017/S0963548301004539zbMath0979.05088WikidataQ122897802 ScholiaQ122897802MaRDI QIDQ2726708
Publication date: 21 February 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Maximum packings of the complete graph with uniform length cycles ⋮ Packing closed trails into dense graphs. ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ Packing cycles in complete graphs ⋮ Decompositions into 2-regular subgraphs and equitable partial cycle decompositions ⋮ Cycle decompositions of complete multigraphs ⋮ Cycle packings of the complete multigraph
This page was built for publication: On the Alspach Conjecture
