## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is β€β__w__. Let $\cal G$ be the class of simple planar graphs
β¦ LIBER β¦
Spanning trees in graphs of minimum degree 4 or 5
β Scribed by Jerrold R. Griggs; Mingshen Wu
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 1019 KB
- Volume
- 104
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Light subgraphs in planar graphs of mini
β
B. Mohar; R. Ε krekovski; H.-J. Voss
π
Article
π
2003
π
John Wiley and Sons
π
English
β 326 KB
π 1 views
Contractible edges inn-connected graphs
β
Yoshimi Egawa
π
Article
π
1991
π
Springer Japan
π
English
β 482 KB
On numbers of vertices of maximum degree
β
Jerzy Topp; Preben D. Vestergaard
π
Article
π
1996
π
Elsevier Science
π
English
β 611 KB
For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it