Fractional Coloring of Triangle-Free Planar Graphs

  • Zdeněk Dvořák
  • Jean-Sébastien Sereni
  • Jan Volec
DOI: https://doi.org/10.37236/4135
Keywords: Fractional colouring, Planar graphs

Abstract

We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.

Published
2015-10-16
How to Cite
Dvořák, Z., Sereni, J.-S., & Volec, J. (2015). Fractional Coloring of Triangle-Free Planar Graphs. The Electronic Journal of Combinatorics, 22(4), P4.11. https://doi.org/10.37236/4135
Issue
Volume 22, Issue 4 (2015)
Article Number
P4.11