Edge cuts leaving components of order at least m

An m-restricted edge cut is an edge cut of a connected graph which disconnects this graph with each component having order at least m. Graphs that contain m-restricted edge cuts are characterized in this paper if they have order at least image. For graphs without this order restriction, we present two necessary and sufficient conditions to determine whether they contain m-restricted edge cuts.