𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with certain families of spanning trees

✍ Scribed by P Erdös; R.J Faudree; C.C Rousseau; R.H Schelp

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
510 KB
Volume
32
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with all spanning trees nonisomor
Graphs with all spanning trees nonisomorphic
✍ Lars Døvling Andersen; Preben Dahl Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 487 KB

The paper presents some results on graphs that do not have two distinct isomorphic spanning trees. It is proved that any such connected graph with at least two vertices must have the property that each end-block has just one edge. On the other hand, the class of such graphs is quite large; it is sho

Graphs with homeomorphically irreducible
Graphs with homeomorphically irreducible spanning trees
✍ Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 509 KB

## Abstract It is an NP‐complete problem to decide whether a graph contains a spanning tree with no vertex of degree 2. We show that these homeomorphically irreducible spanning trees are contained in all graphs with minimum degree at least __c__√__n__ and in triangulations of the plane. They are ne

On graphs with the maximum number of spa
On graphs with the maximum number of spanning trees
✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta