Math 2.0

concept

Eulerian trail

Summary

An Eulerian trail is a trail that uses every edge of a graph exactly once. The question of which graphs have one is the origin of graph theory. The node Eulerian trail gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (1 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Eulerian_path, Definition

What links here

Definitions

Instances