Shortest edge-disjoint paths in graphs (Q5096182): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint shortest paths in graphs
@@ Property / cites work: Disjoint shortest paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Geodetic connectivity of graphs
@@ Property / cites work: Geodetic connectivity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a graph to be weakly k-linked
+Normal rank
@@ Property / cites work @@
+The subgraph homeomorphism problem
@@ Property / cites work: The subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Q3718456
@@ Property / cites work: Q3718456 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing disjoint paths on expander graphs
@@ Property / cites work: Constructing disjoint paths on expander graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0029011
+Normal rank
@@ Property / OpenAlex ID @@
+W2096782096
@@ Property / OpenAlex ID: W2096782096 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5096182