A spanning subgraph of G whose components are k disjoint paths is a spanning k-path of G.When applying induc-tive methods to construct a Hamiltonian cycle in a hypercube,the spanning k-path palys a crucial role.In this paper,we ob-tainned the following result.Let u,v,x,y be pairwise distinct vertices in Q 4 with p(u)=p(v)≠p(x)=p(y).If M was a matching in Q4-{u,v,x,y},then there exists a spanning 2-path Pu,x+Pv.y of Q4 passing through M.
维普
万方数据