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

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
4 Extracted Citations
16 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 16 references

Lastrina. List precoloring extension in planar graphs

  • M. Axenovich, J. P. Hutchinson, A M.
  • Discrete Math.,
  • 2011
1 Excerpt

A theorem on map colorings

  • R. Škrekovski
  • Bull. of Inst. of Comb. and Applic.,
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…