This article will present a technique for traversing a graph. Several questions arise here. For example, can we walk along the edges of a graph starting from a vertex and returning to it by visiting each edge of the graph exactly once? Similarly, can we walk along the edges of a graph starting from a vertex and returning to it while visiting each vertex of the graph exactly once? As can be seen, both questions are identical, but what is important is to consider two circuits that answer the above questions, namely the Euler circuit and the Hamilton circuit. Solving the Hamilton circuit for most graphs is very difficult. In this section, we will examine these questions and discuss the difficulty of solving them.

Graph, Euler’s Path, Hamilton’s Paths

Gary Haggard, John Schlipf & Sue Whiteside, Discrete Mathematics for Computer Science, Thomson Learning Academic Resource Center, 2006.

H. Rosen Kenneth, Discrete Mathematics and Its Applications, Seventh Edition, Monmouth University, Published by McGraw-Hill, a business unit of The McGraw-Hill Companies, Inc., 1221 Avenue of the Americas, New York, NY 10020, 2012.

Johnson Baugh, Richard, Discrete Mathematics, Eight edition, DePaul University, Chicago, 1941. Copyright © 2018, 2009, 2005 by Pearson Education.

Lipchitz−Lipson. Schaum’s, Outline of Theory and Problems of Discrete Math, Department of Mathematics, The McGraw−Hill Companies, 2004.

Oscar Levin, Discrete Mathematics An Open Introduction, School of Mathematical Science University of Northern Colorado, 2013.

S. Epps Susanna, Discrete mathematics with applications, fifth edition, DePaul University, University of Nebraska Lincoln, Printed in the United States of America, 2018.

Seymour Lipchitz & Marc Lars Lipson, Theory and Problems of Discrete Mathematics, Third edition, by The McGraw-Hill Companies, 2007.