Eulerian and Hamiltonian Walks

Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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.

Original languageEnglish
Title of host publicationSpringerBriefs in Mathematics
PublisherSpringer Science and Business Media B.V.
Number of pages12
Publication statusPublished - 2019

Publication series

NameSpringerBriefs in Mathematics
ISSN (Print)2191-8198
ISSN (Electronic)2191-8201

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Eulerian and Hamiltonian Walks'. Together they form a unique fingerprint.

Cite this