{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:27:33Z","timestamp":1648589253329},"reference-count":9,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0012-365x(87)90015-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"261-270","source":"Crossref","is-referenced-by-count":1,"title":["Characterization of diagrams by 0-1 inequalities"],"prefix":"10.1016","volume":"63","author":[{"given":"I.G.","family":"Rosenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90015-X_BIB1","unstructured":"M. Aigner and G. Prins, k-orientable graphs, unpublished."},{"key":"10.1016\/0012-365X(87)90015-X_BIB2","first-page":"14","author":"Ne\u0161et\u0159il","year":"1985","journal-title":"Complexity of diagrams"},{"key":"10.1016\/0012-365X(87)90015-X_BIB3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9939-1978-0507350-7","article-title":"On a probabilistic graph-theoretical method","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Proc. Amer. Soc."},{"key":"10.1016\/0012-365X(87)90015-X_BIB4","series-title":"Theory of Graphs","author":"Ore","year":"1962"},{"key":"10.1016\/0012-365X(87)90015-X_BIB5","series-title":"On reorienting graphs by pushing down maximal vertices","first-page":"27","author":"Pretzel","year":"1984"},{"key":"10.1016\/0012-365X(87)90015-X_BIB6","series-title":"On graphs that can be oriented as diagrams of ordered sets","first-page":"28","author":"Pretzel","year":"1984"},{"key":"10.1016\/0012-365X(87)90015-X_BIB7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF00396277","article-title":"Unsolved problems","volume":"1","author":"Rival","year":"1984","journal-title":"Order"},{"key":"10.1016\/0012-365X(87)90015-X_BIB8","series-title":"Graphs and Order, the rule of graphs in the theory of ordered sets and its applications","first-page":"103","volume":"Vol. 147","author":"Rival","year":"1985"},{"key":"10.1016\/0012-365X(87)90015-X_BIB9","series-title":"Preprint CRM-1351","first-page":"35","article-title":"Characterization of diagrams by 0-1 inequalities","author":"Rosenberg","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8790015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8790015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:27:48Z","timestamp":1555154868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X8790015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0012365X8790015X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90015-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}