Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable

DOI10.1016/j.ejc.2019.07.007zbMath1419.05054arXiv1802.04179OpenAlexW2964094665MaRDI QIDQ2323251

Xiaolan Hu, Zdeněk Dvořák

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\((a : b)\)-colorable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (2)

The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Planar graphs without 4- and 6-cycles are (7 : 2)-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs have independence ratio at least 3/13
• Steinberg's conjecture is false
• Fractional coloring of triangle-free planar graphs
• Every planar map is four colorable. I: Discharging
• Planar Ramsey numbers
• A lower bound for the independence number of a planar graph
• Colorings of plane graphs: a survey
• Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph
• Girth and fractional chromatic number of planar graphs
• A (<5)-Colour Theorem for Planar Graphs

This page was built for publication: Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable