Loading [MathJax]/jax/output/HTML-CSS/jax.js

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

  • 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 kn1, 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 n2 with one exception in the case when n=k+1=4. On the other hand, for any n3 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.


Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: Hamiltonian paths,spanning paths,hypercube,vertex fault tolerance,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

2 Documents citing this article

Consultation statistics

This page has been seen 234 times.
This article's PDF has been downloaded 397 times.