We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1d50539 commit a030d35Copy full SHA for a030d35
src/sage/graphs/orientations.py
@@ -47,7 +47,7 @@ def strong_orientations_iterator(G):
47
48
A strong orientation of a graph is an orientation of its edges such that the
49
obtained digraph is strongly connected (i.e. there exist a directed path
50
- between each pair of vertices). According to Robbin's theorem (see the
+ between each pair of vertices). According to Robbins' theorem (see the
51
:wikipedia:`Robbins_theorem`), the graphs that have strong orientations are
52
exactly the 2-edge-connected graphs (i.e., the bridgeless graphs).
53
0 commit comments