On claw-decomposition of complete graphs and complete bigraphs

The packing and covering of the complete graph I: the forests of order five

“…Hence, the theorem is proved for n 7. For n=Sm, 8m+I we have an F4-decomposition [5,6]. Hence, we again have to prove the theorem for the cases:…”

Colourings of star systems

“…and n e 2 ⩾ [6]. A positive integer n is said to be admissible if there exists an e-star system of order n.…”

{C<sub>k</sub>, P<sub>k</sub>, S<sub>k</sub>} -Decompositions of Balanced Complete Bipartite Multigraphs

“…Decompositions of graphs into k-stars have also attracted a fair share of interest (see [1]- [3]). Articles of k Pdecompositions of interest include [4] [5].…”