An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2018.06.005
@@ Property / DOI: 10.1016/j.disc.2018.06.005 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2963732236
@@ Property / OpenAlex ID: W2963732236 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06837
@@ Property / arXiv ID: 1708.06837 / rank @@
+Normal rank
@@ Property / cites work @@
+Terminal-pairability in complete bipartite graphs
@@ Property / cites work: Terminal-pairability in complete bipartite graphs / 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 @@
+Q3139528
@@ Property / cites work: Q3139528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4243059
@@ Property / cites work: Q4243059 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129648484
@@ Property / Wikidata QID: Q129648484 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2018.06.005
@@ Property / DOI: 10.1016/J.DISC.2018.06.005 / rank @@
+Normal rank