𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On vertex-degree restricted paths in polyhedral graphs

✍ Scribed by Igor Fabrici; Erhard Hexel; Stanislav Jendrol’; Hansjoachim Walther

Book ID
108316397
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
194 KB
Volume
212
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing k-edge trees in graphs of restri
Packing k-edge trees in graphs of restricted vertex degrees
✍ A.K. Kelmans 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and τ~__k__~ (__G__) the maximum number of disjoint __k__‐edge trees in __G__. In this paper we show that if __G__ ∈ ${\cal G}^{s}\_{2}$ a