Opening book details…
Can I read Constructive Characterizations for Packing and Covering with Trees on EtoBox?
Constructive Characterizations for Packing and Covering with Trees by András Frank; László Szegő is a Computer Science article available to read on EtoBox.
What is Constructive Characterizations for Packing and Covering with Trees about?
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.
Who reads Constructive Characterizations for Packing and Covering with Trees?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- András Frank; László Szegő
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)