Arbitrarily vertex decomposable graph: различия между версиями

'''Arbitrarily vertex decomposable graph''' — ''[[произвольно вершинно разложимый граф]].''

A [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> of order <math>\,n</math> is said to be '''arbitrarily vertex decomposable''', if for each sequence <math>(n_{1}, \ldots, n_{k})</math> of positive integers such that <math>n_{1} + \ldots + n_{k} = n</math> there exists

a partition <math>(V_{1}, \ldots, V_{k})</math> of the [[vertex]] set of <math>\,G</math> such

that, for each <math>i \in \{1, \ldots, k\}</math>, <math>V_{i}</math> induces a [[connected graph|connected]] [[subgraph]] of <math>\,G</math> on <math>\,n_{i}</math> vertices.

* ''[[Admissible sequence]]''.