{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:22Z","timestamp":1725544882514},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422259"},{"type":"electronic","value":"9783540455356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45535-3_12","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:51Z","timestamp":1265917191000},"page":"145-159","source":"Crossref","is-referenced-by-count":0,"title":["An Extension of a Theorem of Henneberg and Laman"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Szeg\u0151","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,21]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"A. Frank: On the orientation of graphs. J. Combinatorial Theory, Ser. B, Vol. 28,No. 3 (1980), 251\u2013261","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"12_CR2","unstructured":"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\u201363"},{"key":"12_CR3","unstructured":"A. Frank: Connectivity and network flows, in: Handbook of Combinatorics (eds. R. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz), Elsevier Science B.V. (1995) 111\u2013177."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"A. Frank and Z. Kir\u00e1ly: Graph orientations with edge-connection and parity constraints. Combinatorica (to appear)","DOI":"10.1007\/s004930200003"},{"key":"12_CR5","unstructured":"L. H enneberg: Die graphische Statik der starren Systeme. Leipzig (1911)"},{"key":"12_CR6","unstructured":"Z. Kir\u00e1ly, personal communication (2000)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"G. Laman: On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4 (1970) 331\u2013340","journal-title":"J. Engineering Math"},{"key":"12_CR8","unstructured":"L. Lov\u00e1sz: Combinatorial Problems and Exercises. North-Holland (1979)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01238648","volume":"25","author":"W. Mader","year":"1974","unstructured":"W. Mader: Ecken vom Innen-und Aussengrad k in minimal n-fach kantenzusammenh \u00f4ngenden Digraphen. Arch. Math. 25 (1974), 107\u2013112","journal-title":"Arch. Math"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","volume":"3","author":"W. Mader","year":"1982","unstructured":"W. Mader: Konstruktion aller n-fach kantenzusammenh\u00f4ngenden Digraphen. Europ.J. Combinatorics 3 (1982) 63\u201367","journal-title":"Europ.J. Combinatorics"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C. St","year":"1961","unstructured":"C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of nite graphs. J. London Math. Soc. 36 (1961) 445\u2013450","journal-title":"J. London Math. Soc"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. St","year":"1964","unstructured":"C. St. J. A. Nash-Williams: Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964) 12","journal-title":"J. London Math. Soc"},{"key":"12_CR13","first-page":"53","volume":"17","author":"T.-S. Tay","year":"1991","unstructured":"T.-S. Tay: Henneberg\u2019s method for bar and body frameworks. Structural Topology 17 (1991) 53\u201358","journal-title":"Structural Topology"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W. T. Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors. J.London Math. Soc. 36 (1961) 221\u2013230","journal-title":"J.London Math. Soc."},{"key":"12_CR15","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"W. T. Tutte","year":"1966","unstructured":"W. T. Tutte: Connectivity in Graphs. Toronto University Press, Toronto (1966)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45535-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T22:08:23Z","timestamp":1590617303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45535-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422259","9783540455356"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45535-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}