A lower bound for the chromatic capacity in terms of the chromatic number of a graph

Bing Zhou. A lower bound for the chromatic capacity in terms of the chromatic number of a graph. Discrete Mathematics, 313(20):2146-2149, 2013. [doi]

@article{Zhou13,
  title = {A lower bound for the chromatic capacity in terms of the chromatic number of a graph},
  author = {Bing Zhou},
  year = {2013},
  doi = {10.1016/j.disc.2013.05.012},
  url = {http://dx.doi.org/10.1016/j.disc.2013.05.012},
  researchr = {https://researchr.org/publication/Zhou13},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {313},
  number = {20},
  pages = {2146-2149},
}