## 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
β¦ LIBER β¦
Spanning trees with specified differences in Cayley graphs
β Scribed by Ben Seamone; Brett Stevens
- Book ID
- 113567442
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 221 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Graphs with homeomorphically irreducible
β
Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen
π
Article
π
1990
π
John Wiley and Sons
π
English
β 509 KB
Graphs with all spanning trees nonisomor
β
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
SPANNING TREES IN POLYTOPAL GRAPHS
β
Joseph Malkevitch
π
Article
π
1979
π
John Wiley and Sons
π
English
β 253 KB
Spanning Trees in Regular Graphs
β
McKay, Brendan D.
π
Article
π
1983
π
Elsevier Science
π
English
β 558 KB
On a Spanning Tree with Specified Leaves
β
Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto
π
Article
π
2008
π
Springer Japan
π
English
β 88 KB
Graphs with certain families of spanning
β
P ErdΓΆs; R.J Faudree; C.C Rousseau; R.H Schelp
π
Article
π
1982
π
Elsevier Science
π
English
β 510 KB