List-Coloring Graphs on Surfaces with Varying List-Sizes

[摘要] Let $G$ be a graph embedded on a surface $S_\varepsilon$ with Euler genus $\varepsilon > 0$, and let $P\subset V(G)$ be a set of vertices mutually at distance at least 4 apart. Suppose all vertices of $G$ have $H(\varepsilon)$-lists and the vertices of

[学科分类] 离散数学和组合数学

[关键词] list-coloring;Heawood number;graphs on surfaces