Abstract
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most.
Cite
CITATION STYLE
APA
Dvořák, Z., Sereni, J. S., & Volec, J. (2015). Fractional coloring of triangle-free planar graphs. Electronic Journal of Combinatorics, 22(4). https://doi.org/10.37236/4135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free