Superfluous paths in strong digraphs (Q594892): Difference between revisions

@@ Property / author @@
-Q594890
@@ Property / author: Q594890 / rank @@
-Normal rank
@@ Property / author @@
+Cláudio Leonardo Lucchesi
@@ Property / author: Cláudio Leonardo Lucchesi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified treatment of nearly reducible and nearly decomposable matrices
+Normal rank
@@ Property / cites work @@
+Minimally 2-connected graphs.
@@ Property / cites work: Minimally 2-connected graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Minimally strong digraphs
@@ Property / cites work: Minimally strong digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Minimal Blocks
@@ Property / cites work: On Minimal Blocks / rank @@
+Normal rank
@@ Property / cites work @@
+On the Exponent of a Primitive, Nearly Reducible Matrix. II
+Normal rank