Title of article
On-line arbitrarily vertex decomposable trees Original Research Article
Author/Authors
Mirko Hor??k، نويسنده , , Zsolt Tuza، نويسنده , , Mariusz Wo?niak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
10
From page
1420
To page
1429
Abstract
A tree T is arbitrarily vertex decomposable if for any sequence image of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by image. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.
Keywords
On-line , Arbitrarily vertex decomposable graphs
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886515
Link To Document