{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:33:29Z","timestamp":1649194409629},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":6438,"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":[[1995,12]]},"DOI":"10.1016\/0012-365x(94)00165-f","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"185-196","source":"Crossref","is-referenced-by-count":0,"title":["Plurality preference digraphs realized by trees\u2014I. Necessary and sufficient conditions"],"prefix":"10.1016","volume":"147","author":[{"given":"K.B.","family":"Reid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhen","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00165-F_BIB1","doi-asserted-by":"crossref","unstructured":"W. Gu, K.B. Reid and W. Schnyder, Realizations of digraphs by preferences based on distances in graphs, J. Graph Theory, to appear.","DOI":"10.1002\/jgt.3190190309"},{"key":"10.1016\/0012-365X(94)00165-F_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1515\/crll.1869.70.185","article-title":"Sur les assemblages des lignes","volume":"70","author":"Jordan","year":"1869","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0012-365X(94)00165-F_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90606-G","article-title":"Plurality preference digraphs realized by trees. II: On realization numbers","volume":"101","author":"Reid","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00165-F_BIB4","series-title":"Combinatorics and Ordered Sets","first-page":"263","article-title":"Stories about order and the letter N (en)","volume":"57","author":"Rival","year":"1986"},{"key":"10.1016\/0012-365X(94)00165-F_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190020304","article-title":"Centers to centroids in graphs","volume":"2","author":"Slater","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400165F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400165F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:59:43Z","timestamp":1556650783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400165F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0012365X9400165F"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00165-f","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}