Packing k-edge trees in graphs of restricted vertex degrees

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 (a1) if G ∈ ${\cal G}^{s}_{2}$ and s ≥ 4, then τ2(G) ≥ v(G)/(s + 1), (a2) if G ∈ $...

Full description

Bibliographic Details

Published in:	Journal of graph theory Vol. 55; no. 4; pp. 306 - 324
Main Author:	Kelmans, A.K.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.08.2007
Subjects:	2-edge and k-edge paths k-edge trees polynomial time approximation algorithms subgraph packing
ISSN:	0364-9024, 1097-0118
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!