Skip to main content
SpringerLink
Log in

Eulerian and Hamiltonian Walks

  • Chapter
  • First Online:
From Domination to Coloring

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 541 Accesses

Abstract

There are two topics in graph theory with a long history, both of which involve traversing graphs, one traversing all the edges in a graph and the second traversing all the vertices in a graph. It is these two topics that are discussed in this chapter.

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

Access this chapter

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
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

Institutional subscriptions

References

  1. G. Chartrand, A.D. Polimeni, M.J. Stewart, The existence of $1$-factors in line graphs, squares, and total graphs. Nedrl. Akad. Wetensch. Proc. Ser. A 76; Indag. Math. 35, 228–232 (1973)

    Article  MathSciNet  Google Scholar 

  2. G. Chartrand, T. Thomas, V. Saenpholphat, P. Zhang, A new look at Hamiltonian walks. Bull. Inst. Comb. Appl. 42, 37–52 (2004)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. L. Euler, Solutio problematis ad geometriam situs pertinentis. Comment. Acad. Sci. Imp. Petropol. 8, 128–140 (1736)

    Google Scholar 

  5. S.E. Goodman, S.T. Hedetniemi, Eulerian walks in graphs. SIAM J. Comput. 2, 16–27 (1973)

    Article  MathSciNet  Google Scholar 

  6. S.E. Goodman, S.T. Hedetniemi, On Hamiltonian walks in graphs. Congr. Numer. 335–342 (1973)

    Google Scholar 

  7. S.E. Goodman, S.T. Hedetniemi, On Hamiltonian walks in graphs. SIAM J. Comput. 3, 214–221 (1974)

    Article  MathSciNet  Google Scholar 

  8. S.T. Hedetniemi, On minimum walks in graphs. Nav. Res. Logist. Q. 15, 453–458 (1968)

    Article  MathSciNet  Google Scholar 

  9. C. Hierholzer, Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Math. Ann. 6, 30–32 (1873)

    Article  MathSciNet  Google Scholar 

  10. M.K. Kwan, Graphic programming using odd or even points. Acta Math. Sin. 10, 264–266 (Chinese) (1960); translated as Chin. Math. 1, 273–277 (1960)

    Google Scholar 

  11. O. Ore, Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Gary Chartrand & Ping Zhang

  2. Department of Mathematics, East Tennessee State University, Johnson City, TN, USA

    Teresa W. Haynes

  3. Department of Mathematics, University of Johannesburg, Johannesburg, South Africa

    Michael A. Henning

Authors
  1. Gary Chartrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teresa W. Haynes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael A. Henning
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ping Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gary Chartrand .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chartrand, G., Haynes, T.W., Henning, M.A., Zhang, P. (2019). Eulerian and Hamiltonian Walks. In: From Domination to Coloring. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-31110-0_6

Download citation

Publish with us

Policies and ethics

Search

Navigation