Commit 2026-10-15 17:18 cfc55fc5
View on Github →feat(Combinatorics/SimpleGraph/Connectivity): simple graph is 2-edge-connected iff it has no bridge (#42839) This PR proves the equivalence of a graph being 2-edge-connected iff it has no bridge resolving the relevant TODO.