On arbitrarily vertex decomposable trees

被引：12

作者：

Hornak, Mirko ^{[1
]}

Woiniak, Mariusz ^{[2
]}

机构：

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

[2] Fac Appl Math AGH, Dept Discrete Math, PL-30059 Krakow, Poland

来源：

DISCRETE MATHEMATICS | 2008年 / 308卷 / 07期

关键词：

arbitrarily vertex decomposable tree; star-like tree;

D O I：

10.1016/j.disc.2007.04.008

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A tree T is arbitrarily vertex decomposable if for any sequence tau 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; from a result by Barth and Fournier it follows that Delta(T) <= 4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：1268 / 1281

页数：14

共 12 条

[1] Packing circuits into KN [J].