Euler circuit

An Euler circuit is a connected graph such that starting at a vertex $a$ , one can traverse along every edge of the graph once to each of the other vertices and return to vertex $a$ . In other words, an Euler circuit is an Euler path that is a circuit. Thus, using the properties of odd and even http://planetmath.org/node/788degree vertices given in the definition of an Euler path, an Euler circuit exists if and only if every vertex of the graph has an even degree.

This graph is an Euler circuit as all vertices have degree 2.

This graph is not an Euler circuit.

单词	EulerCircuit
释义	Euler circuit An Euler circuit is a connected graph such that starting at a vertex $a$ , one can traverse along every edge of the graph once to each of the other vertices and return to vertex $a$ . In other words, an Euler circuit is an Euler path that is a circuit. Thus, using the properties of odd and even http://planetmath.org/node/788degree vertices given in the definition of an Euler path, an Euler circuit exists if and only if every vertex of the graph has an even degree. This graph is an Euler circuit as all vertices have degree 2. This graph is not an Euler circuit.
随便看	Krein-Milman theorem KripkeSemantics Kripke semantics KripkeSemanticsForIntuitionisticPropositionalLogic Kripke semantics for intuitionistic propositional logic KripkeSemanticsForModalPropositionalLogic Kripke semantics for modal propositional logic KripkeSubmodel Kripke submodel KroneckerDelta Kronecker delta KroneckerProduct Kronecker product KroneckersJugendtraum KroneckersLemma KroneckerSymbol Kronecker symbol KroneckerWeberTheorem Kronecker-Weber theorem Kronecker’s Jugendtraum Kronecker’s lemma KrullDimension Krull dimension KrullIntersectionTheorem Krull intersection theorem