Further decompositions of complete tripartite graphs into 5-cycles

Cavenagh, N. J. (2002) Further decompositions of complete tripartite graphs into 5-cycles. Discrete Mathematics, 256 1-2: 55-81. doi:10.1016/S0012-365X(01)00462-9


Author Cavenagh, N. J.
Title Further decompositions of complete tripartite graphs into 5-cycles
Journal name Discrete Mathematics   Check publisher's open access policy
ISSN 0012-365X
Publication date 2002-09-28
Sub-type Article (original research)
DOI 10.1016/S0012-365X(01)00462-9
Volume 256
Issue 1-2
Start page 55
End page 81
Total pages 27
Editor P. L. Hammer
Place of publication Netherlands
Publisher Elsevier Science BV
Collection year 2002
Language eng
Subject C1
280405 Discrete Mathematics
780101 Mathematical sciences
Abstract Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword Mathematics
Graph Decomposition
Complete Tripartite Graph 5-cycle
Trade
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Mathematics and Physics
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 5 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 14 Aug 2007, 17:54:56 EST