An extension of a theorem of Henneberg and Laman?

A. Frank, László Szegő

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages145-159
Number of pages15
Volume2081
ISBN (Print)3540422250, 9783540422259
Publication statusPublished - 2001
Event8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands
Duration: Jun 13 2001Jun 15 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2081
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
CountryNetherlands
CityUtrecht
Period6/13/016/15/01

Fingerprint

Spanning tree
Theorem
Graph in graph theory
Disjoint
Union
Generalization

Keywords

  • Constructive characterization
  • Covering by trees
  • Graph
  • Packing
  • Rigidity

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2081). Springer Verlag.

An extension of a theorem of Henneberg and Laman? / Frank, A.; Szegő, László.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2081 Springer Verlag, 2001. p. 145-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2081).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2081, Springer Verlag, pp. 145-159, 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001, Utrecht, Netherlands, 6/13/01.
Frank A, Szegő L. 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. Springer Verlag. 2001. p. 145-159. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Frank, A. ; Szegő, László. / An extension of a theorem of Henneberg and Laman?. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2081 Springer Verlag, 2001. pp. 145-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{be0234438dc547b487f8a3825c18575e,
title = "An extension of a theorem of Henneberg and Laman?",
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.",
keywords = "Constructive characterization, Covering by trees, Graph, Packing, Rigidity",
author = "A. Frank and L{\'a}szl{\'o} Szegő",
year = "2001",
language = "English",
isbn = "3540422250",
volume = "2081",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "145--159",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An extension of a theorem of Henneberg and Laman?

AU - Frank, A.

AU - Szegő, László

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Constructive characterization

KW - Covering by trees

KW - Graph

KW - Packing

KW - Rigidity

UR - http://www.scopus.com/inward/record.url?scp=84947252695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947252695&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947252695

SN - 3540422250

SN - 9783540422259

VL - 2081

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 145

EP - 159

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -