A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
List-coloring embedded graphs
[chapter]
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
For any fixed surface Σ of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Σ is colorable from an assignment of lists of size three in time O(|V (G)|). Furthermore, we can allow a subgraph (of any size) with at most s components to be precolored, at the expense of increasing the time complexity of the algorithm to O |V (G)| K(g+s)+1 for some absolute constant K; in both cases, the multiplicative constant hidden in the O-notation depends on g and s.
doi:10.1137/1.9781611973105.72
dblp:conf/soda/DvorakK13
fatcat:kc272dhajfajxh4ypvnauzd2ty