{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:00Z","timestamp":1759063740443},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90123-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"617-632","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["The acyclic disconnection of a digraph"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Victor","family":"Neumann-Lara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90123-1_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.4153\/CMB-1967-028-6","article-title":"Cycles of each length in regular tournaments","volume":"10","author":"Alspach","year":"1967","journal-title":"Canad. Math. Bull."},{"issue":"4","key":"10.1016\/S0012-365X(99)90123-1_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190160405","article-title":"On the minimum size of tight hypergraphs","volume":"16","author":"Arocha","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90123-1_BIB3","series-title":"Surveys in Graph Theory","first-page":"131","article-title":"Paths, trees and cycles in tournaments","volume":"115","author":"Bang-Jensen","year":"1996"},{"key":"10.1016\/S0012-365X(99)90123-1_BIB4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0012-365X(96)00038-6","article-title":"Paths and cycles in extended and decomposable digraphs","volume":"164","author":"Bang-Jensen","year":"1997","journal-title":"Discrete Math."},{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/S0012-365X(99)90123-1_BIB5"},{"key":"10.1016\/S0012-365X(99)90123-1_BIB6","series-title":"Proc. 9th Manitoba Conf. on Numerical Mathematics Computing","first-page":"3","article-title":"Problems and results in number theory and graph theory","author":"Erd\u00f6s","year":"1979"},{"issue":"6","key":"10.1016\/S0012-365X(99)90123-1_BIB7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/jgt.3190150604","article-title":"Some extremal results in cochromatic and dichromatic theory","volume":"15","author":"Erd\u00f6s","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90123-1_BIB8","unstructured":"P. Erd\u00f6s, V. Neumann-Lara, On the dichromatic number of a graph, in preparation."},{"key":"10.1016\/S0012-365X(99)90123-1_BIB9","first-page":"365","article-title":"Extension of Turan's and Brooks' theorems and new notions of stability and coloring in digraphs","volume":"17","author":"Jacob","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(99)90123-1_BIB10","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\/S0012-365X(99)90123-1_BIB11","first-page":"601","article-title":"The generalized dichromatic number of a digraph","volume":"37","author":"Neumann-Lara","year":"1981","journal-title":"Colloquia Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/S0012-365X(99)90123-1_BIB12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(93)E0113-I","article-title":"The 3 and 4-dichromatic tournaments of minimum order","volume":"135","author":"Neumann-Lara","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90123-1_BIB13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0012-365X(96)00128-8","article-title":"Vertex critical 4-dichromatic circulant tournaments","volume":"170","author":"Neumann-Lara","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90123-1_BIB14","unstructured":"V. Neumann-Lara, M.A. Piza\u00f1a, Externally loose k-dichromatic tournaments, in preparation."},{"key":"10.1016\/S0012-365X(99)90123-1_BIB15","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:21:53Z","timestamp":1553214113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99901231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":15,"alternative-id":["S0012365X99901231"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90123-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}