typo: 3-vertex

sagemath · Aug 18, 2017 · 356d3ac · 356d3ac
1 parent d7cea7f
commit 356d3ac
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/src/sage/graphs/generic_graph.py b/src/sage/graphs/generic_graph.py
@@ -5020,7 +5020,7 @@ def planar_dual(self, embedding=None):
             sage: G.planar_dual()
             Traceback (most recent call last):
             ...
-            NotImplementedError: Finding the planar_dual is only works if the graph is at least 3 vertex-connected.
+            NotImplementedError: Finding the planar_dual is only works if the graph is at least 3-vertex-connected.
 
         .. TODO::
 
@@ -5033,7 +5033,7 @@ def planar_dual(self, embedding=None):
         self._scream_if_not_simple()
 
         if self.vertex_connectivity() < 3:
-            raise NotImplementedError("Finding the planar_dual is only works if the graph is at least 3 vertex-connected.")
+            raise NotImplementedError("Finding the planar_dual is only works if the graph is at least 3-vertex-connected.")
         from . import graph
         return graph.Graph([[tuple(_) for _ in self.faces()], lambda f,g: not set([tuple(reversed(e)) for e in f]).isdisjoint(g)], loops=False)