A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs

Musiri M. Balakrishnarajan, Ponnambalam Venuvanalingam. A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs. Computers & Chemistry, 19(2):101-105, 1995. [doi]

@article{BalakrishnarajanV95,
  title = {A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs},
  author = {Musiri M. Balakrishnarajan and Ponnambalam Venuvanalingam},
  year = {1995},
  doi = {10.1016/0097-8485(94)00056-K},
  url = {http://dx.doi.org/10.1016/0097-8485(94)00056-K},
  tags = {traversal, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BalakrishnarajanV95},
  cites = {0},
  citedby = {0},
  journal = {Computers & Chemistry},
  volume = {19},
  number = {2},
  pages = {101-105},
}