Fleischner's theorem

ID: fleischner-s-theorem

Fleischner's theorem is a result in graph theory that relates to the properties of cycles in Eulerian graphs. Specifically, it states that every 2-edge-connected graph (a graph where there are at least two vertex-disjoint paths between any two vertices) contains a cycle that includes every edge of the graph. This is closely associated with the concept of an Eulerian circuit, which is a cycle that visits every edge of a graph exactly once.

New to topics? Read the docs here!