Maximum packing for biconnected outerplanar graphs Original Research Article

The problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected outerplanar graph H on nh vertices isomorphic to a “pattern” biconnected outerplanar graph G on ng vertices is shown to be solvable in time O((nhng)2).