Separation of graphs into three components by the removal of edges
Donald L. Goldsmith, Bennet Manvel, Vance Faber · Journal of Graph Theory · 1980
Abstract Several ways to separate a connected graph into three components by the removal of edges are discussed. Graphical parameters that count the number of edges removed are introduced and the relations between these parameters are given.