An asymptotic solution to the cycle decomposition problem for complete graphs
type: Item
instance of: scholarly article
title: An asymptotic solution to the cycle decomposition problem for complete graphs
zbMATH Open document ID: 1213.05205
author: Daniel Horsley
author: Darryn Bryant
published in: Journal of Combinatorial Theory. Series A
publication date: 2010-09-27T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5791976
zbMATH Keywords: cycle decompositions
zbMATH Keywords: graph decompositions
MaRDI profile type: Publication
full work available at URL: j.jcta.2010.03.015
OpenAlex ID: W1992779658
cites work: On Alspach's conjecture with two even cycle lengths
cites work: Cycle decompositions of \(K_n\) and \(K_n-I\)
cites work: On the Alspach conjecture
cites work: Packing circuits into \(K_N\).
cites work: Packing closed trails into dense graphs.
cites work: Q5421810
cites work: Skolem-type difference sets for cycle systems
cites work: Packing cycles in complete graphs
cites work: Decompositions of complete graphs into long cycles
cites work: Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
cites work: Decompositions of complete graphs into triangles and Hamilton cycles
cites work: Q3059009
cites work: Hamilton cycle decomposition of 6-regular circulants of odd order
cites work: Q3698826
cites work: On Alspach's conjecture
cites work: Q5310230
cites work: Verification of a Conjecture of Th. Skolem.
cites work: Cycle decompositions. III: Complete graphs and fixed length cycles.
cites work: On certain distributions of integers in pairs with given differences
DOI: 10.1016/J.JCTA.2010.03.015
description: scientific article; zbMATH DE number 5791976