# Semigraceful Eulerian Graphs

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

An Eulerian path visits all the edges of a graph in sequence, with no edges repeated. In 1736, Euler solved the Königsberg bridges problem by noting that the four regions of Königsberg each bordered an odd number of bridges, but that only two odd-valenced vertices could be in an Eulerian graph.

[more]
Contributed by: Ed Pegg Jr (August 2015)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

detailSectionParagraph## Permanent Citation

"Semigraceful Eulerian Graphs"

http://demonstrations.wolfram.com/SemigracefulEulerianGraphs/

Wolfram Demonstrations Project

Published: August 31 2015