Multipartite graph decomposition: cycles and closed trails

Billington, Elizabeth J. (2004) Multipartite graph decomposition: cycles and closed trails. Le Matematiche, LIX I-II: 53-72.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ78499_OA.pdf Full text (open access) application/pdf 490.04KB 1
Author Billington, Elizabeth J.
Title Multipartite graph decomposition: cycles and closed trails
Journal name Le Matematiche   Check publisher's open access policy
ISSN 0373-3505
Publication date 2004
Sub-type Article (original research)
Open Access Status File (Publisher version)
Volume LIX
Issue I-II
Start page 53
End page 72
Total pages 20
Place of publication Catania, Italy
Publisher Dipartmento di Matematica, Universita degli Studi di Catania
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Formatted abstract
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts are not all of size 1, so the graph is not Kn ), in the case that the cycle lengths are “small”. Cycles up to length n are considered, when the complete multipartite graph has n parts, but not hamilton cycles. Properties which the decompositions may have, such as being gregarious, are also mentioned.
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status UQ

Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 07:45:43 EST