On-line arbitrarily vertex decomposable trees

Authors:
Mirko Horňák;Zsolt Tuza;Mariusz Woniak
Affiliations:
Institute of Mathematics, P. J. Šafárik University, Jesenná 5, 040 01 Košice, Slovakia;Computer and Automation Institute, Hungarian Academy of Sciences, Hungary and Department of Computer Science, University of Veszprém, Hungary;Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 1
Cited 1

Decomposable trees: a polynomial algorithm for tripodes

Discrete Applied Mathematics

Note: On the structure of arbitrarily partitionable graphs with given connectivity

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 @t. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.