An algorithm for counting short cycles in bipartite graphs

Thomas R. Halford, Keith M. Chugg. An algorithm for counting short cycles in bipartite graphs. IEEE Transactions on Information Theory, 52(1):287-292, 2006. [doi]

@article{HalfordC06,
  title = {An algorithm for counting short cycles in bipartite graphs},
  author = {Thomas R. Halford and Keith M. Chugg},
  year = {2006},
  doi = {10.1109/TIT.2005.860472},
  url = {http://doi.ieeecomputersociety.org/10.1109/TIT.2005.860472},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HalfordC06},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {52},
  number = {1},
  pages = {287-292},
}