{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:39:19Z","timestamp":1775716759233,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,2,1]],"date-time":"1978-02-01T00:00:00Z","timestamp":255139200000},"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":12950,"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":[[1978,2]]},"DOI":"10.1016\/0095-8956(78)90078-3","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"61-75","source":"Crossref","is-referenced-by-count":98,"title":["Distances in orientations of graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"V","family":"Chv\u00e1tal","sequence":"first","affiliation":[]},{"given":"C","family":"Thomassen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(78)90078-3_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0095-8956(78)90078-3_BIB2","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(78)90078-3_BIB3","doi-asserted-by":"crossref","unstructured":"S. A. Cook, The complexity of theorem proving procedures, in \u201cProceedings of the Third Annual ACM Symposium on Theory of Computing,\u201d pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/0095-8956(78)90078-3_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent subsets","volume":"B69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0095-8956(78)90078-3_BIB5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, Trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(78)90078-3_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0095-8956(78)90078-3_BIB7","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(78)90078-3_BIB8","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1147\/rd.45.0497","article-title":"On Moore graphs with diameter 2 and 3","volume":"4","author":"Hoffman","year":"1960","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0095-8956(78)90078-3_BIB9","first-page":"23","article-title":"On a problem of graph theory","volume":"2","author":"Katona","year":"1967","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0095-8956(78)90078-3_BIB10","series-title":"Proceedings of the Fourth S.-E. Conference on Combinatorics, Graph Theory and Computing","first-page":"3","article-title":"Coverings and colorings of hypergraphs","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/0095-8956(78)90078-3_BIB11","author":"Moon","year":"1968"},{"key":"10.1016\/0095-8956(78)90078-3_BIB12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"Amer. Math. Monthly"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900783?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900783?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T21:50:54Z","timestamp":1549230654000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895678900783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,2]]}},"alternative-id":["0095895678900783"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(78)90078-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1978,2]]}}}