The adaptable choosability number grows with the choosability number |
| |
Authors: | Michael Molloy Giovanna Thron |
| |
Affiliation: | aUniversity of Toronto, Department of Computer Science, 10 King’s College Road, Toronto, ON, Canada, M5S 3G4 |
| |
Abstract: | The adaptable choosability number of a multigraph G, denoted cha(G), is the smallest integer k such that every edge labeling of G and assignment of lists of size k to the vertices of G permits a list coloring of G in which no edge e=uv has both u and v colored with the label of e. We show that cha grows with ch, i.e. there is a function f tending to infinity such that cha(G)≥f(ch(G)). |
| |
Keywords: | Adaptable coloring List coloring |
本文献已被 ScienceDirect 等数据库收录! |
|