Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: arbitrary vertex decomposable (AVD) graph

Sortuj według:

Ogranicz wyniki do:

Recursively arbitrarily vertex-decomposable graphs

Baudon O., Gilbert F., Woźniak M.

Opuscula Mathematica

2012

Vol. 32, no. 4

689-706

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 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.