On the sizes of graphs and their powers: the undirected case (Q643002): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2011.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1966559200
@@ Property / OpenAlex ID: W1966559200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228228
@@ Property / cites work: Q4228228 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3001191
@@ Property / cites work: Q3001191 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500916
@@ Property / cites work: Q4500916 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692391
@@ Property / cites work: Q4692391 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5520566
@@ Property / cites work: Q5520566 / rank @@
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Minimal oriented graphs of diameter 2
@@ Property / cites work: Minimal oriented graphs of diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3273705
@@ Property / cites work: Q3273705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5543322
@@ Property / cites work: Q5543322 / rank @@
+Normal rank
@@ Property / cites work @@
+Diameters in graphs
@@ Property / cites work: Diameters in graphs / rank @@
+Normal rank