Title of article
Maximum packing for biconnected outerplanar graphs Original Research Article
Author/Authors
Tomas Kovacs، نويسنده , , Andrzej Lingas، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
10
From page
85
To page
94
Abstract
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).
Journal title
Discrete Applied Mathematics
Serial Year
2000
Journal title
Discrete Applied Mathematics
Record number
885044
Link To Document