{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:27:50Z","timestamp":1649107670047},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4915,"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":[[2000,2]]},"DOI":"10.1016\/s0166-218x(99)00137-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"251-259","source":"Crossref","is-referenced-by-count":2,"title":["Subtrees of bipartite digraphs \u2014 the minimum degree condition"],"prefix":"10.1016","volume":"99","author":[{"given":"Irmina A.","family":"Zio\u0142 o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00137-7_BIB1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0095-8956(90)90081-A","article-title":"Cycles and paths of many lengths in bipartite digraphs","volume":"B 50","author":"Amar","year":"1990","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(99)00137-7_BIB2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02579454","article-title":"Longest paths in digraphs","volume":"1","author":"Bermond","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(99)00137-7_BIB3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/jctb.1994.1030","article-title":"Subtrees and subforests of graphs","volume":"B 61","author":"Brandt","year":"1994","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(99)00137-7_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.3190050204","article-title":"Long paths and cycles in oriented graphs","volume":"5","author":"Jackson","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00137-7_BIB5","unstructured":"B. Orchel, Embedding of (p,q)-trees, Rapport IM AGH, 1997."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:50:49Z","timestamp":1555969849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0166218X99001377"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00137-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}