Skip to main content

Variations on a theorem of Pósa

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

Keywords

  • Hamiltonian Cycle
  • Complete Bipartite Graph
  • Hamilton Circuit
  • Trivial Graph
  • Hamiltonian Graph

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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. G. Chartrand and F. Harary, Theory of Graphs (P. Erdös and G. Katona, eds.) Akadémiai Kiadó, Budapest, 1968, 61–63.

    Google Scholar 

  2. G. Chartrand, S.F. Kapoor, and H.V. Kronk, A sufficient condition for n-connectedness of graphs, Mathematika, 15 (1968), 51–52.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. G. Chartrand, S.F. Kapoor, and H.V. Kronk, A generalization of hamiltonian-connected graphs, to appear.

    Google Scholar 

  4. G. Chartrand, S.F. Kapoor, and D.R. Lick, n-hamiltonian graphs, J. Combinatorial Theory, to appear.

    Google Scholar 

  5. G. Chartrand and H.V. Kronk, Randomly traceable graphs, J. SIAM Appl. Math., 16 (1968), 696–700.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69–81.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. H.V. Kronk, Generalization of a theorem of Pósa, Proc. Amer. Math. Soc., to appear.

    Google Scholar 

  8. O. Ore, Note on hamilton circuits, Amer. Math. Monthly, 65 (1958), 611.

    CrossRef  MathSciNet  Google Scholar 

  9. O. Ore, Arc coverings of graphs, Ann. Mat. Pura Appl., 55 (1961), 315–322.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. L. Pósa, A theorem concerning hamilton lines, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 225–226.

    MathSciNet  MATH  Google Scholar 

  11. L. Pósa, On the circuits of finite graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 8 (1963), 355–361.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Kronk, H.V. (1969). Variations on a theorem of Pósa. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060117

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

  • Online ISBN: 978-3-540-36161-9

  • eBook Packages: Springer Book Archive