Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Graphs pp 364–370Cite as

Cycle lengths in polytopal graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 642))

Abstract

If G is a hamiltonian 3-polytopal graph with n vertices, G will be called almost pancyclic of order m (m ≥ 3, m < n) if G has cycles of all lengths other than m. Some constructions are given for 3-valent 3-polytopal graphs which are almost pancyclic of order m, and some related results and problems are discussed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. A. Bondy, Cycles in graphs. Combinatorial Structures and Their Applications. Gordon and Breach, New York (1970) 15–18.

    Google Scholar 

  2. J. A. Bondy, Pancyclic Graphs I, J. Combinatorial Theory 11 (1971) 80–84.

    Article  MathSciNet  MATH  Google Scholar 

  3. B. Grünbaum, Convex Polytopes. Interscience-Wiley, London, New York, Sydney (1967).

    MATH  Google Scholar 

  4. V. Jacos and S. Jendrol, A problem concerning j-pancyclic graphs. Matematicky Casopis. 24 (1974) 259–262.

    MathSciNet  MATH  Google Scholar 

  5. L. Lovász and M. D. Plummer, On a family of planar bicritical graphs. Proc. London Math. Soc. (3) 30 (1975) 187–208.

    Google Scholar 

  6. J. Malkevitch, On the lengths of cycles in planar graphs. Recent Trends in Graph Theory. Springer-Verlag. Berlin, Heidelberg and New York (1970) 191–195.

    Google Scholar 

  7. G. H. J. Meredith, Cyclic and Colouring Properties of Graphs PhD Thesis. Southampton University (1973).

    Google Scholar 

  8. E. F. Schmeicher and S. L. Hakimi. Pancyclic graphs and a conjecture of Bondy and Chvatal. J. of Combinatorial Theory (B) 17 (1974) 22–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. York College (C.U.N.Y.), Jamaica, New York, 11451, USA

    Joseph Malkevitch

Authors
  1. Joseph Malkevitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malkevitch, J. (1978). Cycle lengths in polytopal graphs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070393

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation