Skip to main content
SpringerLink
Log in

Generating the centrally symmetric 3-polyhedral graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We show that the graphs of the centrally symmetric 3-polytopes can be generated from the graphs of the cube and octahedron by applying pairs of symmetric face splittings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barnette, D.W., Grünbaum, B.: On Steinitz's Theorem concerning convex 3-polytopes and on some properties of planar graphs. The many facets of graph theory, Lecture Notes in Mathematics, V110, Springer-Verlag, Berlin, pp 27–40 (1969)

    Chapter  Google Scholar 

  2. Barnette, D.: Generating planar 4-connected graphs. Israel J. Math.14, 1–13 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barnette, D.: On generating planar graphs, Discrete Math.7, 199–208 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barnette, D.: Generating thec *5-connected graphs. Israel J. Math.28, 151–160 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barnette, D.: A construction of 3-connected graphs. Israel J. Math. (to be published)

  6. Barnette, D.: Map Coloring, Polyhedra, and the Four-color Problem, Mathematical Expositions #8, MAA (1983)

  7. Butler, J.: A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs. Canad. J. Math.26, 686–708 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  8. Grünbaum, B.: Convex Polytopes, John Wiley & sons, New York (1967)

    MATH  Google Scholar 

  9. Kotzig, A.: Regularly connected trivalent graphs without non-trivial cuts of cardinality 3. Acta. Fac. Rerum Natur. Univ. Comenian. Math. Publ.21, 1–14 (1968)

    MathSciNet  Google Scholar 

  10. Steinitz, E., Rademacher, H.: Vorlesungen über die Theorie der Polyeder, Springer, Berlin, 1934

    Google Scholar 

  11. Tutte, W.T.: A Theory of 3-Connected Graphs, Indag. Math.23, 441–455 (1961)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 95616, Davis, CA, USA

    D. W. Barnette

Authors
  1. D. W. Barnette
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barnette, D.W. Generating the centrally symmetric 3-polyhedral graphs. Graphs and Combinatorics 12, 139–147 (1996). https://doi.org/10.1007/BF01858449

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01858449

Search

Navigation