Arbitrarily vertex decomposable trees are of maximum degree at most six

• Autorzy: Hornak, M. , Woźniak, M.
• Języki publikacji: EN

Abstrakty

EN

A tree T is arbitrarily vertex decomposable if for any sequence τ 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 τ. It is proved that if a tree T is arbitrarily vertex decomposable, then Δ(T) ≤ 6.

Słowa kluczowe

EN

tree; vertex decomposition

• Czasopismo: Opuscula Mathematica
• Rocznik: 2003
• Tom: Vol. 23
• Strony: 49-62
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Hornak, M.

• Institute of Mathematics, P. J. Šafárik University, Košice, Slovakia,

autor

Woźniak, M.

• Faculty of Applied Mathematics AGH, Department of Discrfete Mathematics, Krakow, Poland,

Bibliografia

• [1] Balister PN.: Packing circuits into KN. Comb. Probab. Comput., 10 (2001), 463-499
• [2] Balister P. N. : Packing closed trails into dense graphs. J. Comb. Theory B, 88 (2003), 107-118
• [3] Barth D., Baudon O., Puech J.: Decomposable trees: a polynomial algorithm for tripodes. Discrete Appl. Math., 119 (2002), 205-216
• [4] Hornak M., Kockova Z.: On complete tripartite graphs arbitrarily decomposable into closed trails, under preparation
• [5] Horńak M., Woźniak M.: Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Math. J., 53 (2003), 127-134
• [6] Hornak M., Woźniak M.: On arbitrarily vertex decomposable trees, manuscript