Minimally 3-connected graphs (Q1080868)

With reference as numbered in this paper, \textit{W. T. Tutte} [Indagationes Math. 23, 441-455 (1961; Zbl 0101.409)] characterized the class of 3- connected graphs as those attainable from wheels by edge addition and vertex splitting, and \textit{S. Hedetniemi} [Proc. 2nd Louisiana Conf. Comb., Graph Theory, Computing; Baton Rouge, 257-282 (1971; Zbl 0297.05120)] investigated how to obtain the (minimally) 2-connected graphs from \(K_ 3\). Many others, such as Halin and Mader, have worked on characterizations of (minimally) k-connected graphs. With the ultimate goal of finding operations which classify n-connected graphs are precisely those obtainable from \(K_{n+1}\) by successive applications of these operations, in [J. Comb. Theory, Ser. B 17, 281-298 (1974; Zbl 0298.05136)] the reviewer presented some general constructive operations that always preserve n-connectivity, solved the problem in two ways with small sets of simple operations for \(n=3\), and also solved the problem for \(n=4.\) This very nice paper finally fills the gap, making essential use of a result of Barnette and Grunbaum, of providing a constructive characterization of the minimally 3-connected graphs. Made somewhat complicated by the fact that they only be applied when one has ''3- compatibility'', the author solves the problem with a set of three operations.