{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:21Z","timestamp":1771036341164,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230250","type":"print"},{"value":"9783540301400","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_28","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"299-310","source":"Crossref","is-referenced-by-count":5,"title":["An Inductive Construction for Plane Laman Graphs via Vertex Splitting"],"prefix":"10.1007","author":[{"given":"Zsolt","family":"Fekete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Whiteley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Algorithms - ESA 2003","author":"A. Berg","year":"2003","unstructured":"Berg, A., Jord\u00e1n, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 78\u201389. Springer, Heidelberg (2003)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0095-8956(02)00037-0","volume":"88","author":"A. Berg","year":"2003","unstructured":"Berg, A., Jord\u00e1n, T.: A proof of Connelly\u2019s conjecture on 3-connected circuits of the rigidity matroid. J. Combinatorial Theory, Ser. B\u00a088, 77\u201397 (2003)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"28_CR3","unstructured":"Chavez, L., Moshe, L., Whiteley, W.: Bases and circuits for 2-rigidity: constructions via tree coverings, preprint, Department of Mathematics and Statistics, York University (2003)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H.N. Gabow","year":"1992","unstructured":"Gabow, H.N., Westermann, H.H.: Forests, frames and games: Algorithms for matroid sums and applications. Algorithmica\u00a07, 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. AMS Graduate Studies in Mathematics\u00a02 (1993)","DOI":"10.1090\/gsm\/002"},{"key":"28_CR6","unstructured":"Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudotriangulations. In: Proc. 19th ACM Symposium on Computational Geometry, pp. 154\u2013163 (2003), Journal version to appear in Computational Geometry, Theory and Applications, http:\/\/www.arxiv.org\/abs\/math.CO\/0307347"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/0221008","volume":"21","author":"B. Hendrickson","year":"1992","unstructured":"Hendrickson, B.: Conditions for unique graph realizations. SIAM J. Comput.\u00a021(1), 65\u201384 (1992)","journal-title":"SIAM J. Comput."},{"key":"28_CR8","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs, EGRES Technical Report 2002-12, http:\/\/www.cs.elte.hu\/egres\/ ; to appear in J. Combin. Theory Ser. B."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. J. Engineering Math.\u00a04, 331\u2013340 (1970)","journal-title":"J. Engineering Math."},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0603009","volume":"3","author":"L. Lov\u00e1sz","year":"1982","unstructured":"Lov\u00e1sz, L., Yemini, Y.: On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods\u00a03(1), 91\u201398 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"28_CR11","unstructured":"Orden, D., Santos, F., Servatius, B., Servatius, H.: Combinatorial Pseudo Triangulations, preprint, arXiv:math.CO\/0307370v1 (2003)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proc. 41st FOCS, Redondo Beach, California, pp. 443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Streinu, I.: Combinatorial roadmaps in configuration spaces of simple planar polygons. In: Basu, S., Gonzalez-Vega, L. (eds.) Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, pp. 181\u2013206 (2003)","DOI":"10.1090\/dimacs\/060\/12"},{"key":"28_CR14","first-page":"21","volume":"11","author":"T.S. Tay","year":"1985","unstructured":"Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology\u00a011, 21\u201369 (1985)","journal-title":"Structural Topology"},{"key":"28_CR15","first-page":"23","volume":"16","author":"W. Whiteley","year":"1991","unstructured":"Whiteley, W.: Vertex splitting in isostatic Frameworks. Structural Topology\u00a016, 23\u201330 (1991)","journal-title":"Structural Topology"},{"key":"28_CR16","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/conm\/197\/02540","volume-title":"Matroid theory","author":"W. Whiteley","year":"1996","unstructured":"Whiteley, W.: Some matroids from discrete applied geometry. In: Matroid theory, Seattle, WA, 1995. Contemp. Math., vol.\u00a0197, pp. 171\u2013311. Amer. Math. Soc., Providence (1996)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:32Z","timestamp":1605761072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}