Brooks-type theorems for choosability with separation


We consider the following type of problems. Given a graph G = (V; E) and lists L(v) of allowed colors for its vertices v 2 V such that jL(v)j = p for all v 2 V and jL(u) \ L(v)j c for all uv 2 E, is it possible to nd a \list coloring", i.e., a color f (v) 2 L(v) for each v 2 V , so that f (u) 6 = f (v) for all uv 2 E ? We prove that every graph of maximum… (More)
DOI: 10.1002/(SICI)1097-0118(199801)27:1%3C43::AID-JGT7%3E3.0.CO;2-G


Cite this paper

@article{Kratochvl1998BrookstypeTF, title={Brooks-type theorems for choosability with separation}, author={Jan Kratochv{\'i}l and Zsolt Tuza and Margit Voigt}, journal={Journal of Graph Theory}, year={1998}, volume={27}, pages={43-49} }