Induced subgraphs of graphs with large chromatic number. XIII. New brooms
Gyárfás (1975) and Sumner (1981) independently conjectured that for every tree , the class of graphs not containing as an induced subgraph is -bounded, that is, the chromatic numbers of graphs in this class are bounded above by a function of their clique numbers. This remains open for general trees...
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Journal article |
| اللغة: | English |
| منشور في: |
Elsevier
2019
|