Cyclomatic numbers of connected induced subgraphs

Abstract We give an upper bound for ω( A ), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G . We also give an upper bound for ω( A ) when G is triangle-free. We show that these two bounds are best possible. Similar results are obtained for A to be a matching of G .