diff --git a/src/sage/graphs/spanning_tree.pyx b/src/sage/graphs/spanning_tree.pyx
index bbb6c623c6b..cd4ba428a97 100644
--- a/src/sage/graphs/spanning_tree.pyx
+++ b/src/sage/graphs/spanning_tree.pyx
@@ -290,15 +290,6 @@ cpdef kruskal(G, wfunction=None, bint check=False):
         sage: G = my_disconnected_graph(100, 50, directed=False, multiedges=True, loops=True)  # long time
         sage: kruskal(G, check=True)  # long time
         []
-        sage: G = my_disconnected_graph(100, 50, directed=True, multiedges=False, loops=False)  # long time
-        sage: kruskal(G, check=True)  # long time
-        []
-        sage: G = my_disconnected_graph(100, 50, directed=True, multiedges=True, loops=False)  # long time
-        sage: kruskal(G, check=True)  # long time
-        []
-        sage: G = my_disconnected_graph(100, 50, directed=True, multiedges=True, loops=True)  # long time
-        sage: kruskal(G, check=True)  # long time
-        []
 
     If the input graph is a tree, then return its edges. ::