✦ LIBER ✦

Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs

✍ Scribed by R.S. Manikandan; P. Paulraja

Book ID: 108114240
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 570 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.05.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fair Hamilton Decompositions of Complete

Fair Hamilton Decompositions of Complete Multipartite Graphs

✍ C.D. Leach; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

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 H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices

Complete multipartite decompositions of

Complete multipartite decompositions of complete graphs and completen-partite graphs

✍ Huang Qingxue 📂 Article 📅 2003 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 387 KB

Hamilton Cycle Rich 2-factorizations of

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs

✍ L. McCauley; C. A. Rodger 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 81 KB

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

Hamilton decompositions of complete mult

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

✍ C. D. Leach; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract For __m__ ≥ 1 and __p__ ≥ 2, given a set of integers __s__~1~,…,__s__~__q__~ with $s\_j \geq p+1$ for $1 \leq j \leq q$ and ${\sum \_{j\,=\,1}^q} s\_j = mp$, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete __p__‐partite graph $

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views