The smallest graph variety containing all paths

Richard J. Nowakowski, Ivan Rival. The smallest graph variety containing all paths. Discrete Mathematics, 43(2-3):223-234, 1983. [doi]

@article{NowakowskiR83,
  title = {The smallest graph variety containing all paths},
  author = {Richard J. Nowakowski and Ivan Rival},
  year = {1983},
  doi = {10.1016/0012-365X(83)90159-0},
  url = {http://dx.doi.org/10.1016/0012-365X(83)90159-0},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/NowakowskiR83},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {43},
  number = {2-3},
  pages = {223-234},
}