Algorithmic bounds for the chromatic number† (Q5449019): Difference between revisions

@@ Property / cites work @@
+The smallest triangle-free 4-chromatic 4-regular graph
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+On Brooks' Theorem for Sparse Graphs
@@ Property / cites work: On Brooks' Theorem for Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three short proofs in graph theory
@@ Property / cites work: Three short proofs in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+Q4242948
@@ Property / cites work: Q4242948 / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthening of Brooks' theorem
@@ Property / cites work: A strengthening of Brooks' theorem / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds for the chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank