Further results on the Aanderaa-Rosenberg conjecture (Q1237992): Difference between revisions

@@ Property / cites work @@
+Q4046079
@@ Property / cites work: Q4046079 / rank @@
+Normal rank
@@ Property / cites work @@
+On the time required to detect cycles and connectivity in graphs
+Normal rank
@@ Property / cites work @@
+Q4131000
@@ Property / cites work: Q4131000 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4181269
@@ Property / cites work: Q4181269 / rank @@
+Normal rank
@@ Property / cites work @@
+On recognizing graph properties from adjacency matrices
+Normal rank
@@ Property / cites work @@
+Q4133137
@@ Property / cites work: Q4133137 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(80)90057-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2080620555
@@ Property / OpenAlex ID: W2080620555 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jct/KleitmanK80
@@ Property / DBLP publication ID: journals/jct/KleitmanK80 / rank @@
+Normal rank