Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Znaleziono wyników: 1
first rewind previous Strona / 1 next fast forward last
help Sortuj według:

help Ogranicz wyniki do:
1
100%
Opuscula Mathematica
EN A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that [formula], there exists a partition (V1, . . . , Vk) of the vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on [...]
first rewind previous Strona / 1 next fast forward last