Recursively arbitrarily vertex-decomposable suns
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 aim of this paper is to study the recurs...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2011-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol31/4/art/opuscula_math_3137.pdf |
| _version_ | 1819262171486355456 |
|---|---|
| author | Olivier Baudon Frédéric Gilbert Mariusz Woźniak |
| author_facet | Olivier Baudon Frédéric Gilbert Mariusz Woźniak |
| author_sort | Olivier Baudon |
| collection | DOAJ |
| description | 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 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]. |
| first_indexed | 2024-12-23T19:53:27Z |
| format | Article |
| id | doaj.art-8577e94aac3748a398ffd0e8bfea59e4 |
| institution | Directory Open Access Journal |
| issn | 1232-9274 |
| language | English |
| last_indexed | 2024-12-23T19:53:27Z |
| publishDate | 2011-01-01 |
| publisher | AGH Univeristy of Science and Technology Press |
| record_format | Article |
| series | Opuscula Mathematica |
| spelling | doaj.art-8577e94aac3748a398ffd0e8bfea59e42022-12-21T17:33:18ZengAGH Univeristy of Science and Technology PressOpuscula Mathematica1232-92742011-01-01314533547http://dx.doi.org/10.7494/OpMath.2011.31.4.5333137Recursively arbitrarily vertex-decomposable sunsOlivier Baudon0Frédéric Gilbert1Mariusz Woźniak2LaBRI, Université de Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, FranceLaBRI, Université de Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, FranceAGH University of Science and Technology, Faculty of Applied Mathematics, al. A. Mickiewicza 30, 30-059 Krakow, PolandA 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 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].http://www.opuscula.agh.edu.pl/vol31/4/art/opuscula_math_3137.pdfarbitrarily vertex-decomposable graphs (AVD)recursively AVD graphs |
| spellingShingle | Olivier Baudon Frédéric Gilbert Mariusz Woźniak Recursively arbitrarily vertex-decomposable suns Opuscula Mathematica arbitrarily vertex-decomposable graphs (AVD) recursively AVD graphs |
| title | Recursively arbitrarily vertex-decomposable suns |
| title_full | Recursively arbitrarily vertex-decomposable suns |
| title_fullStr | Recursively arbitrarily vertex-decomposable suns |
| title_full_unstemmed | Recursively arbitrarily vertex-decomposable suns |
| title_short | Recursively arbitrarily vertex-decomposable suns |
| title_sort | recursively arbitrarily vertex decomposable suns |
| topic | arbitrarily vertex-decomposable graphs (AVD) recursively AVD graphs |
| url | http://www.opuscula.agh.edu.pl/vol31/4/art/opuscula_math_3137.pdf |
| work_keys_str_mv | AT olivierbaudon recursivelyarbitrarilyvertexdecomposablesuns AT fredericgilbert recursivelyarbitrarilyvertexdecomposablesuns AT mariuszwozniak recursivelyarbitrarilyvertexdecomposablesuns |