List-coloring embedded graphs

DOI10.1137/1.9781611973105.72zbMath1423.05063arXiv1210.7605OpenAlexW2135776655MaRDI QIDQ5741780

Zdeněk Dvořák, Ken-ichi Kawarabayashi

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Hyperbolic families and coloring graphs on surfaces ⋮ 5-list coloring toroidal 6-regular triangulations in linear time ⋮ $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ Coloring near-quadrangulations of the cylinder and the torus

This page was built for publication: List-coloring embedded graphs