Title of article
Constructive characterizations for packing and covering with trees Original Research Article
Author/Authors
Andr?s Frank، نويسنده , , L?szl? Szeg?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
25
From page
347
To page
371
Abstract
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.
Keywords
Graph , Constructive characterization , Packing and covering by trees
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885694
Link To Document