Fractional Coloring of Triangle-Free Planar Graphs

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

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2015-10, Vol.22 (4)
Main Authors: Dvořák, Zdeněk, Sereni, Jean-Sébastien, Volec, Jan
Format: Article
Language:English
Subjects:
Combinatorics
Mathematics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.
ISSN:1077-8926
1077-8926
DOI:10.37236/4135