Cyclically decomposing the complete graph into cycles
type: Item
instance of: scholarly article
title: Cyclically decomposing the complete graph into cycles
zbMATH Open document ID: 1042.05082
author: Shung-Liang Wu
author: Hung-Lin Fu
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2083706
zbMATH Keywords: Complete graph
zbMATH Keywords: Cycle system
zbMATH Keywords: Skolem sequence
zbMATH Keywords: Hooked Skolem sequence
zbMATH Keywords: Near Skolem sequence
MaRDI profile type: Publication
full work available at URL: j.disc.2003.12.009
OpenAlex ID: W2021488421
cites work: Cycle decompositions of \(K_n\) and \(K_n-I\)
cites work: Existence of cyclic \(k\)-cycle systems of the complete graph
cites work: Q5345646
cites work: Verification of a Conjecture of Th. Skolem.
cites work: Q5525915
cites work: On the cyclic decompositions of the complete graph into polygons with odd number of edges
cites work: Cycle decompositions. III: Complete graphs and fixed length cycles.
cites work: The existence of near-Skolem and hooked near-Skolem sequences
cites work: On certain distributions of integers in pairs with given differences
DOI: 10.1016/J.DISC.2003.12.009
description: scientific article; zbMATH DE number 2083706