✦ LIBER ✦

Infinite connected graphs with no end-preserving spanning trees

✍ Scribed by Carsten Thomassen

Book ID: 107884336
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 189 KB
Volume: 54
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90059-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite, highly connected digraphs with

Infinite, highly connected digraphs with no two arc-disjoint spanning trees

✍ Ron Aharoni; Carsten Thomassen 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

A note on graphs with diameter-preservin

A note on graphs with diameter-preserving spanning trees

✍ Fred Buckley; Martin Lewinter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th

Connected graphs with a minimal number o

Connected graphs with a minimal number of spanning trees

✍ N Gaffke 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Undirected simple connected graphs with

Undirected simple connected graphs with minimum number of spanning trees

✍ Zbigniew R. Bogdanowicz 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 765 KB

End-Faithful Spanning Trees of Countable

End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays

✍ Norbert Polat 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 145 KB

Local spanning trees in graphs and hyper

Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity

✍ Matthias Kriesell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 207 KB