Fractional coloring of triangle-free planar graphs
classification
🧮 math.CO
keywords
fractionalplanartriangle-freechromaticcoloringeveryfracgraph
read the original abstract
We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\frac{1}{n+1/3}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.