Coloring graphs from lists with bounded size of their union

Daniel Král, Jiri Sgall. Coloring graphs from lists with bounded size of their union. Journal of Graph Theory, 49(3):177-186, 2005. [doi]

@article{KralS05,
  title = {Coloring graphs from lists with bounded size of their union},
  author = {Daniel Král and Jiri Sgall},
  year = {2005},
  doi = {10.1002/jgt.20073},
  url = {http://dx.doi.org/10.1002/jgt.20073},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KralS05},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {49},
  number = {3},
  pages = {177-186},
}