Advertisement

Independent covers in outerplanar graphs

  • Maciej M. Syslo
  • Paweł Winter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)

Abstract

A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived. A notion of an in-tree is used to study plane embeddings of maximal outerplanar graphs (mops) and their perfect FIVCs. Finally, a linear time algorithm which finds a minimum cardinality perfect FIVC of a mop is developed. It is argued that the results are extendable to arbitrary outerplanar graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Bienstock and C.L. Monma, On the complexity of covering vertices by faces in a planar graph, SIAM J. on Comput. 17 (1988) 53–76.Google Scholar
  2. [2]
    M. Fellews, F. Hickling and M.M. Sysło, Topological parametrization and hard graph problems (extended abstract) Washington State University (1985).Google Scholar
  3. [3]
    M. Fellows, Personal communication (1986).Google Scholar
  4. [4]
    A. Proskurowski and M.M. Sysło, Minimumn dominating cycles in outerplanar graphs, Internat. J. Comput. Inform. Sci. 10 (1981) 127–139.Google Scholar
  5. [5]
    M.M. Sysło, On two problems related to the traveling salesman problem in Halin graphs, in: G. Hammer and D. Pallaschke (eds.), Selected Topics in Operations Research and Mathematical Economics, Lecture Notes in Economics and Math. Systems 266, Springer-Verlag, Berlin (1984) 325–335.Google Scholar
  6. [6]
    M.M. Sysło, Independent face and vertex covers in plane graphs, TR N-184, Institute of Computer Science, University of Wroclaw (1987).Google Scholar
  7. [7]
    M.M. Sysło and P. Winter, Plane embeddings of outerplanar graphs, Technical Report, Institute of Datalogy, University of Copenhagen (1988).Google Scholar
  8. [8]
    M.M. Sysło and P. Winter, Face-independent vertex covers of outerplanar graphs, Technical Report, Institute of Datalogy, University of Copenhagen (1988).Google Scholar
  9. [9]
    R.J. Wilson, Introduction to Graph Theory, Longman, London (1972).Google Scholar
  10. [10]
    P. Winter, Generalized Steiner problem in outerplanar graphs, BIT 25 (1985) 485–496.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Maciej M. Syslo
    • 1
  • Paweł Winter
    • 2
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  2. 2.Institute of DatalogyUniversity of CopenhagenCopenhagen ØDenmark

Personalised recommendations