On the representation number of a crown graph (Q1752592): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963886547
@@ Property / OpenAlex ID: W2963886547 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00674
@@ Property / arXiv ID: 1609.00674 / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring circle graphs
@@ Property / cites work: Coloring circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating split-pair arrangements
@@ Property / cites work: Enumerating split-pair arrangements / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-transitive orientations and word-representable graphs
+Normal rank
@@ Property / cites work @@
+On graphs with representation number 3
@@ Property / cites work: On graphs with representation number 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Words and graphs
@@ Property / cites work: Words and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On representable graphs
@@ Property / cites work: On representable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Word problem of the Perkins semigroup via directed acyclic graphs.
+Normal rank
@@ Property / cites work @@
+Q4027165
@@ Property / cites work: Q4027165 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320435
@@ Property / cites work: Q3320435 / rank @@
+Normal rank
@@ Property / cites work @@
+THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
+Normal rank