On-line arbitrarily vertex decomposable trees

被引：20

作者：

Hornak, Mirko

Tuza, Zsolt

Wozniak, Mariusz

机构：

[1] Safarik Univ, Inst Math, Kosice 04001, Slovakia

[2] Hungarian Acad Sci, Inst Comp & Automat, Budapest, Hungary

[3] Univ Veszprem, Dept Comp Sci, H-8201 Veszprem, Hungary

[4] AGH Univ Sci & Technol, Fac Appl Math, PL-30059 Krakow, Poland

来源：

DISCRETE APPLIED MATHEMATICS | 2007年 / 155卷 / 11期

关键词：

arbitrarily vertex decomposable graphs; on-line;

D O I：

10.1016/j.dam.2007.02.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A tree T is arbitrarily vertex decomposable if for any sequence T 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 tau. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：1420 / 1429

页数：10