{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T13:15:52Z","timestamp":1773321352295,"version":"3.50.1"},"reference-count":5,"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(94)00060-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"335-347","source":"Crossref","is-referenced-by-count":2,"title":["Characterization of (m, 1)-transitive and (3,2)-transitive semi-complete directed graphs"],"prefix":"10.1016","volume":"135","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00060-V_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(88)90175-6","article-title":"On a generalization of transitivity for digraphs","volume":"69","author":"Gy\u00e1rf\u00e1s","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00060-V_BIB2","first-page":"116","article-title":"Graphen und Matrizen","volume":"38","author":"K\u00f6nig","year":"1931","journal-title":"Math. Fiz. Lapok"},{"key":"10.1016\/0012-365X(94)00060-V_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00060-V_BIB4","author":"Sen","year":"1970"},{"key":"10.1016\/0012-365X(94)00060-V_BIB5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400060V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400060V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:46Z","timestamp":1555136566000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400060V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X9400060V"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00060-v","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}