论文信息 - Embedding ladders and caterpillars into the hypercube

Embedding ladders and caterpillars into the hypercube

We present an embedding of generalized ladders as subgraphs into the hypercube. Through an embedding of caterpillars into ladders, we obtain an embedding of caterpillars into the hypercube. In this way we get almost all known results concerning the embedding of caterpillars into the hypercube. In addition we construct an embedding for some new types of caterpillars. Our results support the conjecture of Havel (1984).

Gerd Wechsung | Burkhard Monien | Walter Unger | Sergei L. Bezrukov

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

[2] Michel Mollard,et al. Spanning caterpillars of a hypercube , 1997, J. Graph Theory.

[3] Rainer Bodendiek,et al. Topics In Combinatorics and Graph Theory , 1992 .

[4] Frank Harary,et al. The number of caterpillars , 1973, Discret. Math..

[5] Frank Harary,et al. Graph Theory , 2016 .

[6] Ivan Hal Sudborough,et al. Simulating Binary Trees on Hypercubes , 1988, AWOC.

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.

[9] B. Monien. The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .

[10] I. Havel,et al. On Certain Trees in Hypercubes , 1990 .

[11] Arnold L. Rosenberg,et al. Efficient Embeddings of Trees in Hypercubes* , 2022 .

[12] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .