Recursively arbitrarily vertex-decomposable suns

• Autorzy: Baudon O. , Gilbert F. , Woźniak M.
• Języki publikacji: PL

Abstrakty

EN

A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to /V /, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilbert, M. Woźniak, Recursively arbitrarily vertex-decomposable graphs, research report, 2010].

Słowa kluczowe

EN

arbitrarily vertex-decomposable graphs (AVD); recursively AVD graphs

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2011
• Tom: Vol. 31, no. 4
• Strony: 533--547
• Opis fizyczny: Bibliogr. 4 poz., rys., tab.

Twórcy

autor

Baudon O.

autor

Gilbert F.

autor

Woźniak M.

• AGH University of Science and Technology Faculty of Applied Mathematics al. A. Mickiewicza 30, 30-059 Krakow, Poland,

Bibliografia

• [1] O. Baudon, F. Gilbert, M. Woźniak, Recursively arbitrarily vertex-decomposable graphs, research report, 2010.
• [2] R. Diestel, Graph Theory, Springer, 2005.
• [3] M. Horňák, Z. Tuza, M. Woźniak, On-line arbitrarily vertex decomposable trees, Discrete Applied Mathematics 155 (2007), 1420–1429.
• [4] R. Kalinowski, M. Pilśniak, M. Woźniak, I.A. Zioło. On-line arbitrarily vertex decomposable suns, Discrete Mathematics 309 (2009), 6328–6336.