Premium
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
Author(s) -
Bunge Ryan C.,
Chantasartrassmee Avapa,
El-Zanati Saad I.,
Eynden Charles Vanden
Publication year - 2013
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21632
Subject(s) - combinatorics , mathematics , disjoint sets , cograph , graph , discrete mathematics , integer (computer science) , chordal graph , 1 planar graph , computer science , programming language
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 G ‐decomposition of K 2 n x + 1for every positive integer x . We also show that if G is the union of two vertext‐disjoint cycles of odd length, other thanC 3 ∪ C 3 , then G admits one of these labelings.