Approximating List-Coloring on a Fixed Surface

DOI10.1007/978-3-540-70575-8_28zbMath1153.05319OpenAlexW1598730037MaRDI QIDQ3521930

Ken-ichi Kawarabayashi

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

This page was built for publication: Approximating List-Coloring on a Fixed Surface