The decomposition of graphs into k -connected components

Abstract Generalizing the decomposition concept of connected, biconnected and triconnected components of graphs, k-connected components for arbitrary k∈N are defined. The decompositions for k > 3 are no longer unique. We classify all possible decompositions of a k-connected graph into (k + 1)-connected components.

[1]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

[2]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[3]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  W. T. Tutte.  Connectivity in graphs , 1966 .

[5]  J. Edmonds,et al.  A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[8]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..