Shortest Enclosing Walks and Cycles in Embedded Graphs

J. Scott Provan. Shortest Enclosing Walks and Cycles in Embedded Graphs. Inf. Process. Lett., 30(3):119-125, 1989.

@article{Provan89,
  title = {Shortest Enclosing Walks and Cycles in Embedded Graphs},
  author = {J. Scott Provan},
  year = {1989},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Provan89},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {30},
  number = {3},
  pages = {119-125},
}