Cyclomatic numbers of planar graphs

For a given planar graph G with a set A of independent vertices, we provide a best-possible upper bound for the minimum cyclomatic number of connected induced subgraphs of G containing A. The extremal graphs are also characterized.