Three new upper bounds on the chromatic number (Q765327): Difference between revisions

@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+An ant-based algorithm for coloring graphs
@@ Property / cites work: An ant-based algorithm for coloring graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graphs by iterated local search traversing feasible and infeasible solutions
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed graph edge coloring
@@ Property / cites work: Mixed graph edge coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The sandwich theorem
@@ Property / cites work: The sandwich theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A Column Generation Approach for Graph Coloring
@@ Property / cites work: A Column Generation Approach for Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for graph coloring
@@ Property / cites work: A cutting plane algorithm for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds for the chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+Q4815691
@@ Property / cites work: Q4815691 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank