Abstract
Adominating cycle of a graph lies at a distance of at most one from all the vertices of the graph. The problem of finding the minimum size of such a cycle is proved to be difficult even when restricted to planar graphs. An efficient algorithm solving this problem is given for the class of two-connectedouterplanar graphs, in which all vertices lie on the exterior face in a plane embedding of the graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. R. Garey and D. S. Johnson,Computers and Intractability (Freeman, San Francisco, 1978).
D. E. Knuth,The Art of Computer Programming, Vol. I, 2nd ed. (Addison-Wesley, Boston, 1973).
A. Proskurowski, “Minimum dominating cycles in 2-trees,”Int. J. Comp. Info. Sci. 8(5):405–417 (1979).
M. M. Sysło, “Outerplanar graphs: Characterizations, testing, coding, and counting,”Bull. Acad. Polon. Sci., Ser. Sci. Math. 26:675–684 (1978).
M. M. Sysło, “An efficient cycle vector space algorithm for listing all cycles of a planar graph,” to appear inSIAM J. Computing 10 (1981).
Author information
Authors and Affiliations
Additional information
On leave from Institute of Computer Science, University of Wrocław, Wrocław, Poland.
Rights and permissions
About this article
Cite this article
Proskurowski, A., Sysło, M.M. Minimum dominating cycles in outerplanar graphs. International Journal of Computer and Information Sciences 10, 127–139 (1981). https://doi.org/10.1007/BF00977745
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977745