✦ LIBER ✦

Spanning trees in a cactus

✍ Scribed by Y. Egawa; Preben Dahl Vestergaard

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 361 KB
Volume: 110
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90717-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in

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

Spanning Trees in Locally Planar Triangu

Spanning Trees in Locally Planar Triangulations

✍ M.N. Ellingham; Z.C. Gao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 970 KB

The number of spanning trees in buckmins

The number of spanning trees in buckminsterfullerene

✍ T. J. N. Brown; R. B. Mallion; P. Pollak; Branca R. M. de Castro; J. A. N. F. Go 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbon‐carbon connectivity‐network of the recently diagnosed C~60~‐cluster buckminsterfullerene. This “complexity” turns out to be approximately 3.75 × 10^20^ and it is found necessary to inv

Edge-disjoint spanning trees: A connecte

Edge-disjoint spanning trees: A connectedness theorem

✍ M. Farber; B. Richter; H. Shank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB