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 −...

Full description

Bibliographic Details
Main Authors: Chitra V., Muthusamy A.
Format: Article
Language:English
Published: Sciendo 2013-09-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1687