Learn More
A path covering of a graph is a set of vertex-disjoint simple paths that cover all the vertices of the graph. We consider the graph Q n , the n-dimensional hypercube. The vertices of Q n are n-tuples of 0s and 1s; we say that a vertex is even if it has an even number of 1s and odd otherwise. In Q n , let F be a set of f 1 odd and f 2 even vertices, and let(More)
  • 1