{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:49:06Z","timestamp":1778154546737,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"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":12099,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/0095-8956(80)90071-4","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"251-261","source":"Crossref","is-referenced-by-count":64,"title":["On the orientation of graphs"],"prefix":"10.1016","volume":"28","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(80)90071-4_BIB1","author":"Edmonds","year":"1976","journal-title":"A Min-Max Relation for Submodular Functions on Graphs"},{"key":"10.1016\/0095-8956(80)90071-4_BIB2","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/0095-8956(80)90071-4_BIB3","series-title":"Proceedings, Fifth Hungarian Combinatorial Colloquium","article-title":"How to orient the edges of a graph","author":"Frank","year":"1976"},{"key":"10.1016\/0095-8956(80)90071-4_BIB4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0016-0032(65)90340-6","article-title":"On the degrees of the vertices of a directed graph","volume":"279","author":"Hakimi","year":"1965","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0095-8956(80)90071-4_BIB5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","article-title":"On two minimax theorems in graph theory","volume":"21","author":"Lov\u00e1sz","year":"1976","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0095-8956(80)90071-4_BIB6","series-title":"Recent Progress in Combinatorics","article-title":"Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings","author":"Nash-Williams","year":"1969"},{"key":"10.1016\/0095-8956(80)90071-4_BIB7","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":"142","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895680900714?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895680900714?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:24:16Z","timestamp":1548779056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895680900714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["0095895680900714"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(80)90071-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}