Maximum packing for biconnected outerplanar graphs

Authors
Kovacs, T Lingas, A
Citation
T. Kovacs et A. Lingas, Maximum packing for biconnected outerplanar graphs, DISCR APP M, 100(1-2), 2000, pp. 85-94
Citations number
22
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE APPLIED MATHEMATICS → ACNP
Volume
100
Issue
1-2
Year of publication
2000
Pages
85 - 94
Database
ISI
SICI code
Abstract
The problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected outerplanar graph H on n(h) vertices isomorphic to a "patt ern" biconnected outerplanar graph G on n(g) vertices is shown to be solvab le in time O((n(h)n(g))(2)). (C) 2000 Elsevier Science B.V. All rights rese rved.