Abstract
We give a constructive characterization of graphs which are the union of 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.
Author supplied keywords
Cite
CITATION STYLE
APA
Frank, A., & Szegő, L. (2001). An extension of a theorem of Henneberg and Laman? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 145–159). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free