{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:57:55Z","timestamp":1680436675169},"reference-count":7,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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":1543,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1016\/j.disc.2008.10.004","type":"journal-article","created":{"date-parts":[[2008,11,23]],"date-time":"2008-11-23T04:10:53Z","timestamp":1227413453000},"page":"4181-4184","source":"Crossref","is-referenced-by-count":7,"title":["Integrality properties of edge path tree families"],"prefix":"10.1016","volume":"309","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2008.10.004_b1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Mathematical Operational Research"},{"key":"10.1016\/j.disc.2008.10.004_b2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Mathematical Operational Research"},{"key":"10.1016\/j.disc.2008.10.004_b3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(83)90018-3","article-title":"Hypergraphes de Chaines d\u2019 Aretes d\u2019un Arbre","volume":"43","author":"Fournier","year":"1983","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.disc.2008.10.004_b4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ\u2013graph algorithm for solving the graph realization problem","volume":"21","author":"Fujishige","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.disc.2008.10.004_b5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","article-title":"The edge intersection graphs of paths in a tree","volume":"38","author":"Golumbic","year":"1985","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.disc.2008.10.004_b6","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.disc.2008.10.004_b7","series-title":"Polyhedra and Efficiency","article-title":"Combinatorial optimization","author":"Schrijver","year":"2003"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08005979?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08005979?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,24]],"date-time":"2018-12-24T00:57:00Z","timestamp":1545613020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X08005979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":7,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0012365X08005979"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2008.10.004","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}