Mathematical Puzzles

Dual Cryptograms

Anagrams Cryptograms Doublets
Logic Puzzles Magic Word Squares Sudoku
Chess Fractal Puzzles Tangrams




Intellectual Puzzles
List of Puzzles
Analytical Puzzles
Christmas Puzzles
New Year's Puzzles
Fractal Puzzles
Easter Puzzles
Nature Fractals
Encrypted Quotations
Fractal Images
Baseball Puzzles
Daily Fractal Puzzle
Math Recreations
Algebra Placement
Cryptogram Challenge
Tangram Stories
Puzzle Categories
Thanksgiving Quotes
Christmas Quotes
Christmas Logic
New Year Resolutions
Advertise With Us



Previous Topic

Next Topic


An Euler's tour or path is a path through a graph which starts and ends at the same vertex and includes every edge exactly once. The well-known Königsberg bridges problem is an example of an Euler tour.  Euler showed that a connected graph has an Euler path if and only if it has at most two graph vertices of odd degree.  Vertices of odd degree are vertices which are connected to odd number of neighboring vertices.  Thus, in order for an Euler tour to be possible, a maximum of two vertices are allowed to be connected to odd number of neighboring vertices.


More Mathematical Recreations

Previous Topic

Next Topic


Custom Search

MX iTunes, App Store, iBookstore, and Mac App Store


Hosted By Web Hosting by PowWeb

© 2000-2013 Logicville