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)

Volumn 2081, Issue , 2001, Pages 145-159

  Frank, András ^a,b   Szegő, László ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b ERICSSON RESEARCH   (Hungary)

Author keywords

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

Indexed keywords

COMBINATORIAL OPTIMIZATION; PACKING; RIGIDITY; TREES (MATHEMATICS);

COVERING BY TREES; EDGE-DISJOINT SPANNING TREES; GRAPH; SPANNING TREE;

INTEGER PROGRAMMING;

EID: 84947252695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_12     Document Type: Conference Paper

References (15)

1. A. Frank: On the orientation of graphs. J. Combinatorial Theory, Ser. B, Vol. 28, No. 3 (1980), 251-261
2. A. Frank: Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994, eds. J.R. Birge and K.G. Murty, The University of Michigan, (1994) 34-63
3. A. Frank: Connectivity and network flows, in: Handbook of Combinatorics (eds. R. Graham, M. Grotschel and L. Loväsz), Elsevier Science B.V. (1995) 111-177.
4. A. Frank and Z. Kiraly: Graph orientations with edge-connection and parity constraints. Combinatorica (to appear)
5. L. Henneberg: Die graphische Statik der starren Systeme. Leipzig (1911)
6. Z. Kiräaly, Personal communication (2000)
7. G. Laman: On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4 (1970) 331-340
8. L. Loväsz: Combinatorial Problems and Exercises. North-Holland (1979)
9. W. Mader: Ecken vom Innen- und Aussengrad k in minimal n-fach kantenzusammenhangenden Digraphen. Arch. Math. 25 (1974), 107-112
10. W. Mader: Konstruktion aller n-fach kantenzusammenhängenden Digraphen. Eu-rop. J. Combinatorics 3 (1982) 63-67
11. C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961) 445-450
12. C. St. J. A. Nash-Williams: Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964) 12
13. T.-S. Tay: Henneberg’s method for bar and body frameworks. Structural Topology 17 (1991) 53-58
14. W. T. Tutte: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36 (1961) 221-230
15. W. T. Tutte: Connectivity in Graphs. Toronto University Press, Toronto (1966)