Veblen’s theorem

The edge set of a graph can be partitioned ( into cycles if and only if every vertex has even degree.

Title Veblen’s theorem
Canonical name VeblensTheorem
Date of creation 2013-03-22 12:31:27
Last modified on 2013-03-22 12:31:27
Owner digitalis (76)
Last modified by digitalis (76)
Numerical id 5
Author digitalis (76)
Entry type Theorem
Classification msc 05C38
Related topic Graph
Related topic Cycle
Related topic DigraphMathworldPlanetmath
Related topic DegreeOfAVertex
Related topic DirectedGraph