The largest tree in a random graph (Q1050116): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(83)90034-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2019417869
@@ Property / OpenAlex ID: W2019417869 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Q3923600
@@ Property / cites work: Q3923600 / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques in random graphs
@@ Property / cites work: Cliques in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4114551
@@ Property / cites work: Q4114551 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+On colouring random graphs
@@ Property / cites work: On colouring random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144785
@@ Property / cites work: Q4144785 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits in random graphs
@@ Property / cites work: Hamiltonian circuits in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank