Eulerian graph (undirected)

E2000691 UNEXPLORED

An Eulerian graph (undirected) is a connected graph in which every vertex has even degree, allowing a closed trail that traverses each edge exactly once.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
Eulerian graphs	2
Eulerian graph (undirected) canonical	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Eulerian digraph → generalizes → Eulerian graph (undirected) ⓘ

Introduction to Graph Theory → topic → Eulerian graphs ⓘ

linked to: Eulerian graph (undirected)

Graphs and Applications → coversTopic → Eulerian graphs ⓘ

linked to: Eulerian graph (undirected)