Skip to content

Commit a030d35

Browse files
committed
PR 35981: typo
1 parent 1d50539 commit a030d35

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/sage/graphs/orientations.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ def strong_orientations_iterator(G):
4747
4848
A strong orientation of a graph is an orientation of its edges such that the
4949
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
50+
between each pair of vertices). According to Robbins' theorem (see the
5151
:wikipedia:`Robbins_theorem`), the graphs that have strong orientations are
5252
exactly the 2-edge-connected graphs (i.e., the bridgeless graphs).
5353

0 commit comments

Comments
 (0)