Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: arbitrarily vertex decomposable graph

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On arbitrarily vertex decomposable unicyclic graphs with dominating cycle

100%

Cichacz S., Zioło I.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 3

403-412

A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that $∑^k_{i=1} n_i = n$, there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ {1,...,k} the set $V_i$ induces a connected subgraph of G on $n_i$ vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Cichacz S.

1 Zioło I.

1 2006

Wyniki wyszukiwania

On arbitrarily vertex decomposable unicyclic graphs with dominating cycle