Tomáš Dvořák ; Petr Gregor ; Václav Koubek
-
Spanning paths in hypercubes
dmtcs:3442 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
-
https://doi.org/10.46298/dmtcs.3442
Spanning paths in hypercubesConference paper
Authors: Tomáš Dvořák 1; Petr Gregor 1; Václav Koubek 2
NULL##NULL##NULL
Tomáš Dvořák;Petr Gregor;Václav Koubek
1 Faculty of Mathematics and Physics [Praha/Prague]
2 Institute for Theoretical Computer Science
Given a family {ui,vi}ki=1 of pairwise distinct vertices of the n-dimensional hypercube Qn such that the distance of ui and vi is odd and k≤n−1, there exists a family {Pi}ki=1 of paths such that ui and vi are the endvertices of Pi and {V(Pi)}ki=1 partitions V(Qn). This holds for any n≥2 with one exception in the case when n=k+1=4. On the other hand, for any n≥3 there exist n pairs of vertices satisfying the above condition for which such a family of spanning paths does not exist. We suggest further generalization of this result and explore a relationship to the problem of hamiltonicity of hypercubes with faulty vertices.
S. A. Choudum;S. Lavanya;V. Sunitha, 2009, Disjoint paths in hypercubes with prescribed origins and lengths, International Journal of Computer Mathematics, 87, 8, pp. 1692-1708, 10.1080/00207160802566805.