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 −...
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 |
Similar Items
-
Decomposition of Complete Multigraphs Into Stars and Cycles
by: Beggas Fairouz, et al.
Published: (2015-11-01) -
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges
by: Jeevadoss Shanmugasundaram, et al.
Published: (2015-11-01) -
Multigraph Decomposition Into Multigraphs With Two Underlying Edges
by: Miri Priesler, et al.
Published: (2009-06-01) -
On multigraphic and potentially multigraphic sequences
by: Pirzada Shariefuddin, et al.
Published: (2017-07-01) -
Edge decompositions of multigraphs into multi-2-paths
by: Jan Kratochvil, et al.
Published: (2004-01-01)