Uniform cyclic edge connectivity in cubic graphs

Abstract

A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut is called uniformly cyclicallyk-edge connected(U(k)). We classify theU(5) graphs and show that all cyclically 5-edge connected cubic graphs can be generated from a small finite set ofU(5) graphs by a sequence of defined operations.

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

References

  1. [1]

    L. D. Andersen, H. Fleischner, andB. Jackson: Removable edges in cyclically 4-edge-connected graphs, Research Report R86-10, September 1986, Institut for Elektroniske Systemer, Aalborg Universitetscenter, Denmark.

  2. [2]

    D. Barnette: On generating planar graphs,Disc. Math.,7, 1974, 199–208.

    Google Scholar 

  3. [3]

    F. C. Bussemaker, S. Cobeljic, D. M. Cvetkovic, andJ. J. Seidel: Computer Investigation of Cubic Graphs, Technical University of Eindhoven, Mathematics Research Report, WSK-01, (1976).

  4. [4]

    N. C. Wormald: Classifyingk-connected cubic graphs, Lecture Notes in Mathematics, Springer Verlag, N. Y., Vol. 748, 199–206.

Download references

Author information

Affiliations

Authors

Additional information

MATHDAHCOTAGE.AC.NZ

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Aldred, R.E.L., Holton, D.A. & Jackson, B. Uniform cyclic edge connectivity in cubic graphs. Combinatorica 11, 81–96 (1991). https://doi.org/10.1007/BF01206354

Download citation

AMS subject classification (1980)

  • 05 C 40