Subcubic triangle-free graphs have fractional chromatic number at most 14/5
- 563 Downloads
We show that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233–237].
KeywordsPlanar Graph Maximum Degree Discrete Math Free Graph Fractional Coloring
Unable to display preview. Download preview PDF.
- M. Albertson, B. Bollobás and S. Tucker, The independence ratio and maximum degree of a graph, In: “Proceedings of the Seventh Southeastern Conference on Combinatorics”, Graph Theory, and Computing (1976), Utilitas Math., Congressus Numerantium, No. XVII, 43–50.Google Scholar
- Z. Dvořák, J.-S. Sereni and J. Volec, Subcubic triangle-free graphs have fractional chromatic number at most 14/5, submitted for publication, arXiv:1301.5296.Google Scholar
- D. Ferguson, T. Kaiser and D. Král’, The fractional chromatic number of triangle-free subcubic graphs, to appear in European Journal of Combinatorics.Google Scholar
- C.-H. Liu, An upper bound on the fractional chromatic number of triangle-free subcubic graphs, submitted for publication.Google Scholar