On recognizing graph properties from adjacency matrices (Q1238421): Difference between revisions

@@ Property / author @@
-Jean E. Vuillemin
@@ Property / author: Jean E. Vuillemin / rank @@
-Normal rank
@@ Property / author @@
+Jean E. Vuillemin
@@ Property / author: Jean E. Vuillemin / 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.1016/0304-3975(76)90053-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2016606569
@@ Property / OpenAlex ID: W2016606569 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4046079
@@ Property / cites work: Q4046079 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete subgraphs are elusive
@@ Property / cites work: Complete subgraphs are elusive / rank @@
+Normal rank
@@ Property / cites work @@
+Q5770541
@@ Property / cites work: Q5770541 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / 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 @@
+Q4766997
@@ Property / cites work: Q4766997 / 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