✦ LIBER ✦

Spanning Subgraphs of a Hypercube V: Spanned Subcubes

✍ Scribed by FRANK HARARV; MARTIN LEWINTER

Book ID: 119862769
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 228 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16401.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning subgraphs of a hypercube IV: Ro

Spanning subgraphs of a hypercube IV: Rooted trees

✍ Frank Harary; Martin Lewinter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Regular connected bipancyclic spanning s

Regular connected bipancyclic spanning subgraphs of hypercubes

✍ S.A. Mane; B.N. Waphare 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Spanning subgraphs of a hypercube II: Do

Spanning subgraphs of a hypercube II: Double starlike trees

✍ Frank Harary; Martin Lewinter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Subcube Coverings of Random Spanning Sub

Subcube Coverings of Random Spanning Subgraphs of the n-Cube

✍ Karl Weber 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 896 KB

Let G(n, p ) denote the probability space consisting of all spanning subgraphs g of the n-cube En, and the probability is defined as ERDOS and SPENCER investigated the connectedness of such random graphs for fixed probability p , O<p<l (cf. [l]). I n this paper we study coverings of the vertex set

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 subgraphs of random graphs

✍ Noga Alon; Zoltán Füredi 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 183 KB