论文信息 - An Extension of a Theorem of Henneberg and Laman

An Extension of a Theorem of Henneberg and Laman

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.

András Frank | László Szegö | András Frank | László Szegö

[1] Lebrecht Henneberg,et al. Die graphische Statik der Starren Systeme , 1911 .

[2] C. Nash-Williams. Decomposition of Finite Graphs Into Forests , 1964 .

[3] András Frank,et al. Graph Orientations with Edge-connection and Parity Constraints , 2002, Comb..

[4] W. T. Tutte. Connectivity in graphs , 1966 .

[5] L. Lovász. Combinatorial problems and exercises , 1979 .

[6] András Frank,et al. Connectivity and network flows , 1996 .

[7] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[8] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .

[9] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[10] Tiong-Seng Tay,et al. Henneberg's Method for Bar and Body Frameworks , 1991 .

[11] Wolfgang Mader,et al. Konstruktion aller n-fach kantenzusammenhängenden Digraphen , 1982, Eur. J. Comb..

[12] W. Mader. Ecken vom Innen- und Außengradn in minimaln-fach kantenzusammenhängenden Digraphen , 1974 .

[13] Konstantin Salikhov. On the orientation of graphs , 2000, math/0012252.