Achromatic number is NP-complete for cographs and interval graphs (Q1825646): Difference between revisions

@@ Property / cites work @@
+Q3812222
@@ Property / cites work: Q3812222 / rank @@
+Normal rank
@@ Property / cites work @@
+Total domination in interval graphs
@@ Property / cites work: Total domination in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge inducibility of graphs
@@ Property / cites work: The edge inducibility of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total domination in interval graphs
@@ Property / cites work: Total domination in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the minimum bandwidth of an interval graph
+Normal rank
@@ Property / cites work @@
+Q3686754
@@ Property / cites work: Q3686754 / rank @@
+Normal rank