Recognizing graphs with fixed interval number is NP-complete (Q760213): Difference between revisions

@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Extremal values of the interval number of a graph. II
+Normal rank
@@ Property / cites work @@
+Extremal Values of the Interval Number of a Graph
@@ Property / cites work: Extremal Values of the Interval Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3927276
@@ Property / cites work: Q3927276 / rank @@
+Normal rank
@@ Property / cites work @@
+The interval number of a complete multipartite graph
+Normal rank
@@ Property / cites work @@
+Polynomial Complete Consecutive Information Retrieval Problems
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+The interval number of a planar graph: Three intervals suffice
+Normal rank
@@ Property / cites work @@
+On double and multiple interval graphs
@@ Property / cites work: On double and multiple interval graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(84)90127-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2076027639
@@ Property / OpenAlex ID: W2076027639 / rank @@
+Normal rank