New upper bounds for the chromatic number of a graph

Ladislav Stacho. New upper bounds for the chromatic number of a graph. Journal of Graph Theory, 36(2):117-120, 2001. [doi]

@article{Stacho01,
  title = {New upper bounds for the chromatic number of a graph},
  author = {Ladislav Stacho},
  year = {2001},
  doi = {10.1002/1097-0118(200102)36:2<117::AID-JGT6>3.0.CO;2-7},
  url = {http://dx.doi.org/10.1002/1097-0118(200102)36:2<117::AID-JGT6>3.0.CO;2-7},
  researchr = {https://researchr.org/publication/Stacho01},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {36},
  number = {2},
  pages = {117-120},
}