Edge Disjoint Hamilton Cycles in Knödel Graphs
The vertices of the Knödel graph $W_{\Delta, n}$ on $n \geq 2$ vertices, $n$ even, and of maximum degree $\Delta, 1 \leq \Delta \leq \lfloor log_2(n) \rfloor$, are the pairs $(i,j)$ with $i=1,2$ and $0 \leq j \leq \frac{n}{2} -1$. For $0 \leq j \leq \frac{n}{2} -1$, there is an edge between vertex $...
Main Authors: | Palanivel Subramania Nadar Paulraja, S Sampath Kumar |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-07-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2148/pdf |
Similar Items
-
Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01) -
Well-spread sequences and edge-labellings with constant Hamilton-weight
by: Peter Mark Kayll
Published: (2004-01-01) -
On the Meyniel condition for hamiltonicity in bipartite digraphs
by: Janusz Adamus, et al.
Published: (2014-05-01) -
On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01) -
Graph Decompositions and Factorizing Permutations
by: Christian Capelle, et al.
Published: (2002-01-01)