Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
نویسندگان
چکیده
منابع مشابه
Nonorientable hamilton cycle embeddings of complete tripartite graphs
A cyclic construction is presented for building embeddings of the complete tripartite graph Kn,n,n on a nonorientable surface such that the boundary of every face is a hamilton cycle. This construction works for several families of values of n, and we extend the result to all n with some methods of Bouchet and others. The nonorientable genus of Kt,n,n,n, for t ≥ 2n, is then determined using the...
متن کاملSymmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملFair Hamilton Decompositions of Complete Multipartite Graphs
A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H1 and H2, the difference in the number of edges in H1 and H2 joining vertices in these two parts is at most one. In this paper we completely settle the existence of such decomposi...
متن کاملOn Cyclic Decompositions of Complete Graphs into Tripartite Graphs
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 K2nx+1 for every positive integer x. We also show that if G is the union of two vertext-disjoint cycles of odd length, other than C3 ∪ C3, then G admits one of these labelings.
متن کاملDecompositions of complete tripartite graphs into k-cycles
We show that a complete tripartite graph with three partite sets of equal size m may be decomposed into k-cycles for any k 2: 3 if and only if k divides 3m2 and k ::; 3m.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.03.005