AbstractA tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ; from a result by Barth and Fournier it follows that Δ(T)⩽4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other
A graph \(G = (V,E)\) is arbitrarily vertex decomposable if for any sequence \(\tau\) of positive in...
AbstractLet G be a graph of order n and r, 1≤r≤n, a fixed integer. G is said to be r-vertex decompos...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
AbstractA tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers addin...
AbstractA tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers addin...
(on leave from AGH) A graph G of order n is called arbitrarily vertex decomposable if for each seque...
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a₁,...,aₖ) of p...
AbstractA n-vertex graph is said to be decomposable if for any partition (λ1,…,λp) of the integer n,...
AbstractAn n-vertex graph is said to be decomposable for a partition (λ1,…,λp) of the integer n if t...
A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence ϒ of positive intege...
Abstract. A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive int...
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1,...,nk) ...
AbstractA n-vertex graph is said to be decomposable if, for any partition (λ1,…,λp) of the integer n...
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of p...
AbstractA graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1,…,nk...
A graph \(G = (V,E)\) is arbitrarily vertex decomposable if for any sequence \(\tau\) of positive in...
AbstractLet G be a graph of order n and r, 1≤r≤n, a fixed integer. G is said to be r-vertex decompos...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
AbstractA tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers addin...
AbstractA tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers addin...
(on leave from AGH) A graph G of order n is called arbitrarily vertex decomposable if for each seque...
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a₁,...,aₖ) of p...
AbstractA n-vertex graph is said to be decomposable if for any partition (λ1,…,λp) of the integer n,...
AbstractAn n-vertex graph is said to be decomposable for a partition (λ1,…,λp) of the integer n if t...
A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence ϒ of positive intege...
Abstract. A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive int...
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1,...,nk) ...
AbstractA n-vertex graph is said to be decomposable if, for any partition (λ1,…,λp) of the integer n...
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of p...
AbstractA graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1,…,nk...
A graph \(G = (V,E)\) is arbitrarily vertex decomposable if for any sequence \(\tau\) of positive in...
AbstractLet G be a graph of order n and r, 1≤r≤n, a fixed integer. G is said to be r-vertex decompos...
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into...
DOI
Add to ORKG