Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Structural properties of recursively partitionable graphs with connectivity 2

Autor: Monika Pilsniak, Florent Foucaud, Olivier Baudon, Julien Bensmail

Publikováno v: Discussiones Mathematicae Graph Theory
Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2017, 37, pp.89-115. ⟨10.7151/dmgt.1925⟩
Baudon, O, Bensmail, J, Foucaud, F & Pilsniak, M 2017, ' Structural properties of recursively partitionable graphs with connectivity 2 ', Discussiones Mathematicae. Graph Theory, vol. 37, pp. 89–115 . https://doi.org/10.7151/dmgt.1925
Discussiones Mathematicae Graph Theory, 2017, 37, pp.89-115. ⟨10.7151/dmgt.1925⟩
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 89-115 (2017)

A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1,..., np) of jV (G)j there exists a partition (V1,..., Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bda55b87fa03fc0bdfc6bf398ca94e7
https://hal.archives-ouvertes.fr/hal-00672505