Path Coverings with Prescribed Ends in Faulty Hypercubes

@article{Castaeda2015PathCW,
  title={Path Coverings with Prescribed Ends in Faulty Hypercubes},
  author={Nelson Casta{\~n}eda and Ivan S. Gotchev},
  journal={Graphs and Combinatorics},
  year={2015},
  volume={31},
  pages={833-869}
}
Let Qn be the n-dimensional hypercube, let u1, u2 and u3 be even vertices of Qn and let v1, v2 and v3 be odd vertices of Qn. We will prove that if n ≥ 4, then there exist three paths in Qn, one joining u1 and v1, one joining u2 and u3 and one joining v2 and v3, such that every vertex of Qn is on exactly one of the paths. This is a continuation of the talk “Path coverings with prescribed ends in faulty hypercubes, I”, presented by Vasil Gochev. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Construction of Maximum cycles in faulty binary hypercubes

  • P. P. Parkhomenko
  • Automation and Remote Control, 66
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…