Robbins' theorem
Statement
In graph theory, Robbins' theorem, named after (txt), states that the graphs that have strong orientations are exactly the 2-edge-connected graphs. That is, it is possible to choose a direction for each edge of an undirected graph , turning it into a directed graph that has a path from every vertex to every other vertex, if and only if is connected and has no bridge.
Further reading
- Wikipedia, page 36633800, revision 1321322910, Robbins' theorem. adopted
About this page
| Tag | HTY44KYNYR |
|---|---|
| URI | m2://HTY44KYNYR |
| Kind | statement, proposition |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status HTY44KYNYR. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.