---
tag: HTY44KYNYR
kind: statement
role: proposition
name: Robbins' theorem
sources:
  - wikipedia: en:36633800@r1321322910
    locator: Robbins' theorem
    note: adopted
    mention: wikipedia://en/36633800
    sections: [Statement]
same_as:
  wikidata: Q7341043
  wikipedia: Robbins' theorem
inventory: [CG1HNY6JC6]
---

## 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 $G$, turning it into a [[directed graph|0KFYGSHHF5]] that has a path from every vertex to every other vertex, if and only if $G$ is connected and has no [[bridge|0BANA3XYPF]].