Packing <i>k</i>‐edge trees in graphs of restricted vertex degrees
Packing <i>k</i>‐edge trees in graphs of restricted vertex degrees
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 …