Clique covers and coloring problems of graphs (Q1823258): Difference between revisions

@@ Property / cites work @@
+Q3686719
@@ Property / cites work: Q3686719 / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinatorial problems which I would most like to see solved
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum degree and fractional matchings in uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Some applications of Vizing's theorem to vertex colorings of graphs
+Normal rank
@@ Property / cites work @@
+On the chromatic index of multigraphs without large triangles
+Normal rank
@@ Property / cites work @@
+Q5620610
@@ Property / cites work: Q5620610 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of a theorem of the Bruijn and Erdős on combinatorial designs
+Normal rank