Abstract
In this paper we present a short proof of the characterization theorem on the generic rigidity of a k-body linkage in n-space. As a by-product we find a new proof of Tutte and Nash-Williams' theorem on decomposing a graph into n connected factors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. C. Hopcroft and R. M. Karp, An n5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2, 1973, 225–231.
C. St. J. A. Nash-Williams, Edge disjoint spanning trees of finite graphs, J. Lond. Math. Soc. 36 (1961), 445–450.
K. Sugihara, On redundant bracing in plane skeletal structures, Bull. Electrotech Lab., Japan, 44 (1980), 376–386.
T. S. Tay, Rigidity of multi-graphs I: Linking rigid bodies in n space, Research report No. 63, Math. Dept., National University of Singapore, (submitted for publication).
W. T. Tutte, On the problem of decomposing a graph into n connected factors, J. Lond. Math. Soc. 36 (1961), 221–230.
N. White and W. Whiteley, The algebraic geometry of motions in frameworks, preprint, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Tay, TS. (1984). Rigidity of multi-graphs II. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073111
Download citation
DOI: https://doi.org/10.1007/BFb0073111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive