{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:14:08Z","timestamp":1758824048710},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00464-x","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:09:00Z","timestamp":1062601740000},"page":"347-371","source":"Crossref","is-referenced-by-count":18,"title":["Constructive characterizations for packing and covering with trees"],"prefix":"10.1016","volume":"131","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":"78","reference":[{"key":"10.1016\/S0166-218X(02)00464-X_BIB1","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge disjoint branchings","author":"Edmonds","year":"1973"},{"issue":"3","key":"10.1016\/S0166-218X(02)00464-X_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","article-title":"On the orientation of graphs","volume":"28","author":"Frank","year":"1980","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"10.1016\/S0166-218X(02)00464-X_BIB3","unstructured":"A. Frank, Connectivity augmentation problems in network design, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art, The University of Michigan, 1994, pp. 34\u201363."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB4","series-title":"Handbook of Combinatorics","first-page":"111","article-title":"Connectivity and network flows","author":"Frank","year":"1995"},{"issue":"1","key":"10.1016\/S0166-218X(02)00464-X_BIB5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s004930200003","article-title":"Graph orientations with edge-connections and parity constraints","volume":"22","author":"Frank","year":"2002","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00464-X_BIB6","unstructured":"L. Henneberg, Die graphische Statik der starren Systeme, Leipzig, 1911."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB7","unstructured":"Z. Kir\u00e1ly, personal communication, 1999."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01534980","article-title":"On graphs and rigidity of plane skeletal structures","volume":"4","author":"Laman","year":"1970","journal-title":"J. Engng. Math."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB9","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0166-218X(02)00464-X_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","article-title":"Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"3","author":"Mader","year":"1982","journal-title":"Europ. J. Combinatorics"},{"key":"10.1016\/S0166-218X(02)00464-X_BIB11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On Orientations, Connectivity, and Odd Vertex Pairings in Finite Graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB13","first-page":"53","article-title":"Henneberg's method for bar and body frameworks","volume":"17","author":"Tay","year":"1991","journal-title":"Structural Topology"},{"key":"10.1016\/S0166-218X(02)00464-X_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(02)00464-X_BIB15","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200464X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200464X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:55:09Z","timestamp":1551095709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0200464X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X0200464X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00464-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}