Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863): Difference between revisions

@@ Property / cites work @@
+Triangle-free graphs and forbidden subgraphs
@@ Property / cites work: Triangle-free graphs and forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subtrees in graphs of large chromatic number
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+-colorability and forbidden subgraphs. I: Characterizing pairs
+Normal rank
@@ Property / cites work @@
+Q4780499
@@ Property / cites work: Q4780499 / 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 bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank