Gap strings and spanning forests for bridge graphs of biconnected graphs Original Research Article

A labeling scheme for the gaps of the bridges of a broken cycle C′ of a biconnected graph G is developed. This labeling scheme incorporates the ideas of lexicographic order and of attachment order and is used to order the set of gaps (both proper gaps and cospan gaps) of all bridges of the broken cycle C′. Thus a linear order relation is induced on the set of gaps.