{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:46:53Z","timestamp":1768740413310,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0012-365x(93)e0113-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"233-243","source":"Crossref","is-referenced-by-count":16,"title":["The 3 and 4-dichromatic tournaments of minimum order"],"prefix":"10.1016","volume":"135","author":[{"given":"V.","family":"Neumann-Lara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0113-I_BIB1","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(93)E0113-I_BIB2","first-page":"3","article-title":"Problems and results in number theory and graph theory","author":"Erd\u0151s","year":"1979","journal-title":"Proc. 9th Manitoba Conf. Numer. Math. and Computing"},{"key":"10.1016\/0012-365X(93)E0113-I_BIB3","first-page":"125","article-title":"On the representation of directed graphs as unions of orderings","volume":"9","author":"Erd\u0151s","year":"1964","journal-title":"Publ. Math. Inst. Hungar"},{"key":"10.1016\/0012-365X(93)E0113-I_BIB4","unstructured":"P. Erd\u0151s and V. Neumann-Lara, On the dichromatic number of a graph, in preparation."},{"key":"10.1016\/0012-365X(93)E0113-I_BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","article-title":"The dichromatic number of a digraph","volume":"33","author":"Neumann-Lara","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)E0113-I_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(84)90154-7","article-title":"Vertex critical r-dichromatic tournaments","volume":"40","author":"Neumann-Lara","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0113-I_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0021-9800(70)80061-8","article-title":"Disproof of a conjecture of Erd\u0151s and Moser on tournaments","volume":"9","author":"Reid","year":"1970","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0113I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0113I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:28:22Z","timestamp":1555115302000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0113I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X93E0113I"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0113-i","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}