Decompositions of complete tripartite graphs into triangles with an edge attached

Cavenagh, NJ (2003) Decompositions of complete tripartite graphs into triangles with an edge attached. Utilitas Mathematica, 63 197-211.

Author Cavenagh, NJ
Title Decompositions of complete tripartite graphs into triangles with an edge attached
Journal name Utilitas Mathematica   Check publisher's open access policy
ISSN 0315-3681
Publication date 2003
Sub-type Article (original research)
Volume 63
Start page 197
End page 211
Total pages 15
Editor R.G. Stanton
M.C. Swart
Place of publication Durban, South Africa
Publisher University of Natal
Collection year 2003
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Abstract Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).
Keyword Mathematics, Applied
Statistics & Probability
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collections: School of Mathematics and Physics
2004 Higher Education Research Data Collection
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 02:34:46 EST