Enumeration of labeled connected graphs with k cycles is an open problem . Up to now it has been settled only for k = 1, 2. Unfortunately , these given for-mulas are very complicated . In this paper we improve a series of enum nerations and solve the enumeration problem for k = 3. |