eulerian_path_decision (554B)
1 # Eulerian path decision 2 3 The [computational_problem] of deciding whether a [graph] admits a [eulerian_path] 4 5 It is in [PTIME] on [directed_graphs] and [undirected_graphs] 6 7 Further, for [Eulerian_circuits], the following is true: 8 - a [directed_graph] admits a [Eulerian_circuit] if and only if it is [strongly_connected] and for each [vertex] the [indegree] is equal to the [outdegree] 9 - for such graphs being [strongly_connected] or [weakly_connected] is [equivalent] 10 11 Up: [computational_problem], [eulerian_path] 12 13 See also: [chinese_postman_problem]