On path-pairability of the finite grids (Q2010412): Difference between revisions

@@ Property / author @@
-Jenő Lehel
@@ Property / author: Jenő Lehel / rank @@
-Normal rank
@@ Property / author @@
+Jenő Lehel
@@ Property / author: Jenő Lehel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40879-018-0306-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2902551874
@@ Property / OpenAlex ID: W2902551874 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3585017
@@ Property / cites work: Q3585017 / rank @@
+Normal rank
@@ Property / cites work @@
+Escaping a grid by edge-disjoint paths
@@ Property / cites work: Escaping a grid by edge-disjoint paths / rank @@
+Normal rank
@@ Property / cites work @@
+Networks communicating for each pairing of terminals
+Normal rank
@@ Property / cites work @@
+Q4018554
@@ Property / cites work: Q4018554 / rank @@
+Normal rank
@@ Property / cites work @@
+Terminal-Pairability in Complete Graphs
@@ Property / cites work: Terminal-Pairability in Complete Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The path-pairability number of product of stars
@@ Property / cites work: The path-pairability number of product of stars / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the diameter of path-pairable graphs
@@ Property / cites work: Note on the diameter of path-pairable graphs / rank @@
+Normal rank