$(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five

DOI10.1137/18M1214056zbMath1451.05079arXiv1805.11507OpenAlexW3093618002MaRDI QIDQ5128509

Xiaolan Hu, Zdeněk Dvořák

Publication date: 27 October 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hyperbolicityembedded graphsfractional coloring

Mathematics Subject Classification ID

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

Related Items (2)

3-list-coloring graphs of girth at least five on surfaces ⋮ Fractional Coloring of Planar Graphs of Girth Five

Cites Work

• Unnamed Item
• Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
• Independence in graphs with maximum degree four
• Fractional coloring of triangle-free planar graphs
• The chromatic number of a graph of girth 5 on a fixed surface
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
• Large Independent Sets in Triangle-Free Planar Graphs
• Hyperbolic families and coloring graphs on surfaces
• Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
• List-coloring embedded graphs

This page was built for publication: $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five