Decomposition of 3-connected graphs

Abstract

Cunningham and Edmonds [4[ have proved that a 2-connected graphG has a unique minimal decomposition into graphs, each of which is either 3-connected, a bond or a polygon. They define the notion of a good split, and first prove thatG has a unique minimal decomposition into graphs, none of which has a good split, and second prove that the graphs that do not have a good split are precisely 3-connected graphs, bonds and polygons. This paper provides an analogue of the first result above for 3-connected graphs, and an analogue of the second for minimally 3-connected graphs. Following the basic strategy of Cunningham and Edmonds, an appropriate notion of good split is defined. The first main result is that ifG is a 3-connected graph, thenG has a unique minimal decomposition into graphs, none of which has a good split. The second main result is that the minimally 3-connected graphs that do not have a good split are precisely cyclically 4-connected graphs, twirls (K 3,n for somen≥3) and wheels. From this it is shown that ifG is a minimally 3-connected graph, thenG has a unique minimal decomposition into graphs, each of which is either cyclically 4-connected, a twirl or a wheel.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    Bixby, R. E.: Composition and decomposition of matroids and related topics, Ph. D. thesis, Cornell University. 1972.

  2. [2]

    Bondy, J. A., andU. S. R. Murty:Graph Theory with Applications. American Elsevier, New York. 1976.

    Google Scholar 

  3. [3]

    Cornuéjols, G., D. Naddef, andW. R. Pulleyblank: Halin graphs and the traveling salesman problem.Mathematical Programming 26 (1983), 287–294.

    Google Scholar 

  4. [4]

    Cunningham, W. H., andJ. Edmonds: A combinatorial decomposition theory,Canadian Journal of Mathematics 32 (1980), 734–765.

    Google Scholar 

  5. [5]

    Dawes, R. W.: Minimally 3-connected graphs,Journal of Combinatorial Theory (B) 40 (1986), 159–168.

    Google Scholar 

  6. [6]

    Halin, R.: On the structure onn-connected graphs. In:Recent Progress in Combinatorics, 91–102. Academic Press, New York, 1969.

    Google Scholar 

  7. [7]

    Halin, R.: Untersuchungen über minimalen-fach zusammenhangende graphen,Mathematische Annalen 182 (1969), 175–188.

    Google Scholar 

  8. [8]

    Hopcroft, J. E., andR. E. Tarjan: Dividing a graph into triconnected componentsSIAM Journal on Computing 2 (1973), 135–158.

    Google Scholar 

  9. [9]

    Kanevsky A., andV. Ramachandran: Improved algorithms for graph fourconnectivity, In:28th Annual Symposium on Foundations of Computer Science, 252–259. IEEE, New York. 1987.

    Google Scholar 

  10. [10]

    MacLane, S.: A structural characterization of planar combinatorial graphs,Duke Mathematics Journal 3 (1937), 460–472.

    Google Scholar 

  11. [11]

    Mader, W.: Minimalen-fach zusammenhangende graphen mit maximaler kantenzahl,Journal für die reine angewandte Mathematik 249 (1971), 201–207.

    Google Scholar 

  12. [12]

    Mader, W.: Ecken vom gradn in minimalemn-fach zusammenhangenden graphen,Archiv der Mathematik 23 (1972), 219–224.

    Google Scholar 

  13. [13]

    Menger, K.: Zur allgemeinen Kurventheorie,Fundamenta Mathematicae 10 (1927), 96–115.

    Google Scholar 

  14. [14]

    Rajan, A.: Algorithmic implications of connectivity and related topics in matroid theory, Ph. D. Thesis, Northwestern University. 1986.

  15. [15]

    Robertson, N.: Minimal cyclic-4-connected graphs,Transactions of the American Mathematical Society 284 (1984), 665–687.

    Google Scholar 

  16. [16]

    Seymour, P. D.: Decomposition of regular matroids,Journal of Combinatorial Theory (B) 28 (1980), 305–359.

    Google Scholar 

  17. [17]

    Truemper, K.: A decomposition theory for matroids. I. General results,Journal of Combinatorial Theory (B) 39 (1985), 43–76.

    Google Scholar 

  18. [18]

    Tutte, W. T.:Connectivity in Graphs. University of Toronto Press, Toronto. 1966.

    Google Scholar 

  19. [19]

    Whitney, H.: Non-separable and planar graphs,Transactions of the American Mathematical Society 34 (1932), 339–362.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

Research partially supported by Office of Naval Research Grant N00014-86-K-0689 at Purdue University.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Coullard, C.R., Gardner, L.L. & Wagner, D.K. Decomposition of 3-connected graphs. Combinatorica 13, 7–30 (1993). https://doi.org/10.1007/BF01202787

Download citation

AMS subject classification code (1991)

  • 05 C 40