✦ LIBER ✦

One-legged caterpillars span hypercubes

✍ Scribed by I. Havel; P. Liebl

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 300 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100110

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning caterpillars of a hypercube

✍ Dvo?�k, Tom�?k; Havel, Ivan; Laborde, Jean-Marie; Mollard, Michel 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

Spanning trees of the hypercube Q n have been recently studied by several authors. In this paper, we construct spanning trees of Q n which are caterpillars and establish quantitative bounds for a caterpillar to span Q n . As a corollary, we disprove a conjecture of Harary and Lewinter on the length

Spanning Regular Caterpillars in Hypercu

Spanning Regular Caterpillars in Hypercubes

✍ R. Caha; V. Koubek 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Embedding ladders and caterpillars into

Embedding ladders and caterpillars into the hypercube

✍ Sergei Bezrukov; Burkhard Monien; Walter Unger; Gerd Wechsung 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 594 KB

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 ad

Leafy spanning trees in hypercubes

✍ W. Duckworth; P.E. Dunne; A.M. Gibbons; M. Zito 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We prove that the d-dimensional hypercube, Qd, with n ----2 d vertices, contains a spanning tree with at least 1 log 2 n o n -t-2 leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree 5, which gives (1 -O(loglogn)/log 2 n)n as a lower b

On constructing multiple spanning trees

On constructing multiple spanning trees in a hypercube

✍ Feng-Hsu Wang; Ferng-Ching Lin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Hierarchical spanning trees and distribu

Hierarchical spanning trees and distributing on incomplete hypercubes

✍ Jenn-Yang Tien; Wei-Pang Yang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 873 KB

Tien, J.-Y. and W.-P. Yang, Hierarchical spanning trees and distributing on incomplete hypercubes, Parallel Computing 17 (1991) 1343-1360\_ Incomplete hypercubes are gaining increasing attention as one of the possible solutions for the limitation on the number of nodes in the hypercubes. Distributi