Generalized flowers in $k$-connected graph

In this article we research $k$-cutsets in $k$-connected graphs. We introduce generalized flowers and prove some fundamental statements describing their structure. After this we consider generalized flowers in case $k=4$. When $k=4$ we give a complete description of $4$-cutsets lying in a generalized flower.