Semi-transitive orientations and word-representable graphs (Q908303): Difference between revisions

@@ Property / arXiv ID @@
+.07108
@@ Property / arXiv ID: 1501.07108 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of diagram testing
@@ Property / cites work: On the complexity of diagram testing / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
+Normal rank
@@ Property / cites work @@
+Circle graphs and monadic second-order logic
@@ Property / cites work: Circle graphs and monadic second-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating split-pair arrangements
@@ Property / cites work: Enumerating split-pair arrangements / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs Capturing Alternations in Words
@@ Property / cites work: Graphs Capturing Alternations in Words / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation Graphs
@@ Property / cites work: Alternation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardness of Approximating Poset Dimension
@@ Property / cites work: The Hardness of Approximating Poset Dimension / 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 @@
+On scheduling cycle shops: Classification, complexity and approximation
+Normal rank
@@ Property / cites work @@
+Q4852554
@@ Property / cites work: Q4852554 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank