Generalized flowers in $k$-connected graph. Part 2

We continue the work started in [8] and research $k$-cutsets in $k$-connected graphs. Several new statesments concerning the structure of generalized flowers in $k$-connected graphs are proved here. Generalized flowers in the case $k=4$ are considered after. For $k=4$ we give the description of maximal generalized flowers with an empty center which have a common catset.