Fractional Coloring of Triangle-Free Planar Graphs

  • Zdeněk Dvořák
  • Jean-Sébastien Sereni
  • Jan Volec
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
Article Number
P4.11