On cyclic decompositions of complete graphs into tripartite graphs

Thumbnail Image
File(s)
Author(s)
Other Contributor(s)
University of the Thai Chamber of Commerce. Research Support Office
Publisher(s)
Scopus
University of the Thai Chamber of Commerce
Date Issued
2013
Resource Type
Text::Journal::Journal article
Language
English
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.
Subject(s)
Keywords(s)
Access Rights
public
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.
Rights Holder
University of the Thai Chamber of Commerce
Bibliographic Citation
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.
URI