An attempt to classify bipartite graphs by chromatic polynomials

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy. An attempt to classify bipartite graphs by chromatic polynomials. Discrete Mathematics, 222(1-3):73-88, 2000. [doi]

@article{DongKTLH00,
  title = {An attempt to classify bipartite graphs by chromatic polynomials},
  author = {Feng Ming Dong and Khee Meng Koh and Kee L. Teo and Charles H. C. Little and Michael D. Hendy},
  year = {2000},
  doi = {10.1016/S0012-365X(00)00007-8},
  url = {http://dx.doi.org/10.1016/S0012-365X(00)00007-8},
  tags = {graph-rewriting, C++, rewriting},
  researchr = {https://researchr.org/publication/DongKTLH00},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {222},
  number = {1-3},
  pages = {73-88},
}