List-Coloring Graphs on Surfaces with Varying List-Sizes

@article{Dean2012ListColoringGO,
title={List-Coloring Graphs on Surfaces with Varying List-Sizes},
author={Alice M. Dean and Joan P. Hutchinson},
journal={Electr. J. Comb.},
year={2012},
volume={19},
pages={P50}
}

Let G be a graph embedded on a surface Sε with Euler genus ε > 0, and let P ⊂ V (G) be a set of vertices mutually at distance at least 4 apart. Suppose all vertices of G have H(ε)-lists and the vertices of P are precolored, where H(ε) = ⌊ 7+ √ 24ε+1 2 ⌋ is the Heawood number. We show that the coloring of P extends to a list-coloring of G and that the distance bound of 4 is best possible. Our result provides an answer to an analogous question of Albertson about extending a precoloring of a set… CONTINUE READING