On the chromatic number of \(2 K_2\)-free graphs (Q1634757): Difference between revisions

@@ Property / cites work @@
+Colouring of \((P_3 \cup P_2)\)-free graphs
@@ Property / cites work: Colouring of \((P_3 \cup P_2)\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with no induced \(C_ 4\) and \(2K_ 2\)
@@ Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank @@
+Normal rank
@@ Property / cites work @@
+The Independence Ratio of Regular Graphs
@@ Property / cites work: The Independence Ratio of Regular Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs. VI: Colouring
@@ Property / cites work: Claw-free graphs. VI: Colouring / rank @@
+Normal rank
@@ Property / cites work @@
+On the coverings of graphs
@@ Property / cites work: On the coverings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Recognizing claw-free perfect graphs
@@ Property / cites work: Recognizing claw-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of \(\{P_5,K_4\}\)-free graphs
+Normal rank
@@ Property / cites work @@
+On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2876042
@@ Property / cites work: Q2876042 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic bounds for some classes of \(2 K_2\)-free graphs
+Normal rank
@@ Property / cites work @@
+The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>
+Normal rank
@@ Property / cites work @@
+On the chromatic number of (P_{5},windmill)-free graphs
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank