BibTeX record journals/dm/KiersteadL15

download as .bib file

@article{DBLP:journals/dm/KiersteadL15,
  author       = {Hal A. Kierstead and
                  Bernard Lidick{\'{y}}},
  title        = {On choosability with separation of planar graphs with lists of different
                  sizes},
  journal      = {Discret. Math.},
  volume       = {338},
  number       = {10},
  pages        = {1779--1783},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.disc.2015.01.008},
  doi          = {10.1016/J.DISC.2015.01.008},
  timestamp    = {Fri, 12 Feb 2021 13:49:32 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KiersteadL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics