论文信息 - Spanning Regular Caterpillars in Hypercubes

Spanning Regular Caterpillars in Hypercubes

If a regular caterpillar is a spanning subgraph of a hypercube, then it has 2n-1legs for somenand its length is 2mfor somem.We prove the converse statement: for everynthere existsm0such that for everym?m0a regular caterpillar of length 2mwith 2n-1 legs is a spanning subgraph of a hypercube of dimensionn+m.

Václav Koubek | Rostislav Caha

[1] J. Laborde,et al. Spanning caterpillars of a hypercube , 1997 .

[2] Alan S. Wagner. Embedding Arbitrary Binary Trees in a Hypercube , 1989, J. Parallel Distributed Comput..

[3] Nathan Linial,et al. Matroidal bijections between graphs , 1988, J. Comb. Theory, Ser. B.

[4] Michael Randolph Garey,et al. On cubical graphs , 1975 .

[5] V. Firsov. Isometric embedding of a graph in a Boolean cube , 1965 .

[6] George Papageorgiou,et al. The Complexity of Cubical Graphs , 1985, Inf. Control..

[7] Alan Wagner,et al. Embedding Trees in a Hypercube is NP-Complete , 1990, SIAM J. Comput..

[8] D. Djoković. Distance-preserving subgraphs of hypercubes , 1973 .

[9] Ivan Havel,et al. One-legged caterpillars span hypercubes , 1986, J. Graph Theory.

[10] Ivan Hal Sudborough,et al. Comparing Interconnection Networks , 1988, MFCS.

[11] I. Havel,et al. $B$-valuations of graphs , 1972 .