Spiders can be recognized by counting their legs (Q904532): Difference between revisions

@@ Property / Wikidata QID @@
+Q56267297
@@ Property / Wikidata QID: Q56267297 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1600659061
@@ Property / OpenAlex ID: W1600659061 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2105
@@ Property / arXiv ID: 1411.2105 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3287781
@@ Property / cites work: Q3287781 / rank @@
+Normal rank
@@ Property / cites work @@
+On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
+Normal rank
@@ Property / cites work @@
+A remark on the existence of finite graphs
@@ Property / cites work: A remark on the existence of finite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Orthology relations, symbolic ultrametrics, and cographs
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+Recognizing $P_4 $-Sparse Graphs in Linear Time
@@ Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Cograph Editing: Complexity and Parameterized Algorithms
+Normal rank
@@ Property / cites work @@
+Complexity and parameterized algorithms for cograph editing
+Normal rank
@@ Property / cites work @@
+BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
+Normal rank