Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869): Difference between revisions

@@ Property / cites work @@
+A survey of Nordhaus-Gaddum type relations
@@ Property / cites work: A survey of Nordhaus-Gaddum type relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
+Normal rank
@@ Property / cites work @@
+Q3220612
@@ Property / cites work: Q3220612 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5632603
@@ Property / cites work: Q5632603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Point-Arboricity of a Graph and its Complement
+Normal rank
@@ Property / cites work @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
+Normal rank