Constructive characterizations for packing and covering with trees ?
We give a constructive characterization of undirected graphs which contain k spanning trees after adding any new edge. This is a generalization of a theorem of Henneberg and Laman who gave the characterization for k=2. We also give a constructive characterization of graphs which have k edge-disjoint spanning trees after deleting any edge of them.
05c40