Fractional coloring of triangle-free planar graphs (Q888619)

From MaRDI portal
Revision as of 19:45, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fractional coloring of triangle-free planar graphs
scientific article

    Statements

    Fractional coloring of triangle-free planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 November 2015
    0 references
    Summary: We prove that every planar triangle-free graph on \(n\) vertices has fractional chromatic number at most \(3-\frac{3}{3n+1}\).
    0 references
    0 references
    0 references
    0 references
    0 references
    fractional colouring
    0 references
    planar graphs
    0 references