veblens_theorem (433B)
1 # Veblen's theorem 2 3 https://en.wikipedia.org/wiki/Veblen%27s_theorem 4 5 An [undirected_graph] admits a partition of its edges into [cycles] if and only if every [vertex] has even [degree] (this implies in particular that the graph is [bridgeless]) 6 7 For [directed_graphs], cf https://math.stackexchange.com/questions/348852/veblens-theorem-for-digraphs 8 9 See also: [eulerian_circuit], [cycle_double_cover] 10 11 Up: [theorem], [graph_theory]