Repository logo

Browsing by Subject "arbitrary vertex decomposable (AVD) graph"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Dowolne podziały grafów na części spójne
    (Data obrony: 2009-07-01) Chmielowiec, Dorota
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Recursively arbitrarily vertex-decomposable graphs
    (2012) Baudon, Olivier; Gilbert, Frédéric; Woźniak, Mariusz
    A graph $G=(V,E)$ is arbitrarily vertex decomposable if for any sequence $\tau$ of positive integers adding up to $|V|$, there is a sequence of vertex-disjoint subsets of $V$ whose orders are given by $\tau$, and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs called balloons.