  The main goal of this article is to introduce new quantitative
characteristics of cycles in finite simple connected graphs and to establish
relations of these characteristics with the stretch and spanning tree
congestion of graphs. The main new parameter is named the support number. We
give a polynomial approximation algorithm for the support number with the aid
of yet another characteristic we introduce, named the cycle width of the graph.
