Please use this identifier to cite or link to this item:
Title: On cyclic decompositions of complete graphs into tripartite graphs
Authors: Bunge, R.C. 
Chantasartrassmee, A. 
ElZanati, S.I. 
Eynden, C.V. 
Keywords: cyclic graph decompositions;labelings of tripartite graphs
Issue Date: 2013
Publisher: Scopus
University of the Thai Chamber of Commerce
Source: R.C. Bunge, A. Chantasartrassmee, S.I. ElZanati, C.V. Eynden (2013) On cyclic decompositions of complete graphs into tripartite graphs. Journal of Graph Theory Vol.72 No.1, 90-111.
Abstract: We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic Gdecompositionof K 2nx+1 for every positive integer x. We also show that if G is the union of two vertextdisjoint cycles of odd length, other than C 3∪C 3, then G admits one of these labelings.
Rights: This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Appears in Collections:RSO: Journal Articles

Files in This Item:
File Description SizeFormat 
88.pdf151.34 kBAdobe PDFThumbnail
Show full item record Recommend this item

Page view(s)

checked on Jul 11, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.