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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.