Fractional coloring of triangle-free planar graphs

zbMath1323.05045arXiv1402.5331MaRDI QIDQ888619

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

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.5331

zbMATH Keywords

planar graphsfractional colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (6)

Triangle-free planar graphs with small independence number ⋮ $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five ⋮ Fractional Coloring of Planar Graphs of Girth Five ⋮ Multiple list colouring triangle free planar graphs ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar Ramsey numbers
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• A short list color proof of Grötzsch's theorem
• 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
• Three-coloring triangle-free planar graphs in linear time
• A (<5)-Colour Theorem for Planar Graphs
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Algorithms – ESA 2004

This page was built for publication: Fractional coloring of triangle-free planar graphs