A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903): Difference between revisions

@@ Property / cites work @@
+Independent Sets of Maximum Weight in Apple-Free Graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A one-to-one correspondence between colorings and stable sets
+Normal rank
@@ Property / cites work @@
+Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
+Normal rank
@@ Property / cites work @@
+Q4414490
@@ Property / cites work: Q4414490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365068
@@ Property / cites work: Q5365068 / rank @@
+Normal rank
@@ Property / cites work @@
+Batch processing with interval graph compatibilities between tasks
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q5501309
@@ Property / cites work: Q5501309 / rank @@
+Normal rank