Fractional Coloring of Triangle-Free Planar Graphs

Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec

Abstract


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


Keywords


Fractional colouring; Planar graphs

Full Text: PDF