{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:55:27Z","timestamp":1768740927317,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-3","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(98)00194-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"13-27","source":"Crossref","is-referenced-by-count":7,"title":["Linkages in locally semicomplete digraphs and quasi-transitive digraphs"],"prefix":"10.1016","volume":"196","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00194-0_BIB1","series-title":"Graph Theory, Combinatorics and Applications","first-page":"77","article-title":"A note on a special case of the 2-path problem for semicomplete digraphs","author":"Bang-Jensen","year":"1991"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(91)90002-2","article-title":"Edge-disjoint in- and out-branchings in tournaments and related path problems","volume":"51","author":"Bang-Jensen","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB3","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1002\/jgt.3190140310","article-title":"Locally semicomplete digraphs: a generalization of tournaments","volume":"14","author":"Bang-Jensen","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(92)90645-V","article-title":"On the structure of locally semicomplete digraphs","volume":"100","author":"Bang-Jensen","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0167-5060(08)70447-3","article-title":"On the 2-linkage problem for semicomplete digraphs","volume":"41","author":"Bang-Jensen","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(96)00219-1","article-title":"A classification of locally semicomplete digraphs","volume":"167\/168","author":"Bang-Jensen","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/(SICI)1097-0118(199808)28:4<171::AID-JGT1>3.0.CO;2-G","article-title":"Generalizations of tournaments: a survey","volume":"28","author":"Bang-Jensen","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(95)00318-Q","article-title":"Vertex heaviest paths and cycles in quasi-transitive digraphs","volume":"163","author":"Bang-Jensen","year":"1997","journal-title":"Discrete Math."},{"issue":"No. 51","key":"10.1016\/S0012-365X(98)00194-0_BIB9","article-title":"Finding maximum weight paths and cycles in \u03c6-decomposable digraphs, using flows in networks","author":"Bang-Jensen","year":"1993","journal-title":"Preprint Inst. Math. and CS Odense Univ."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB10","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."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB11","series-title":"Surveys in Graph Theory (San Francisco C.A. 1995)","first-page":"131","article-title":"Paths, trees and cycles in tournaments","volume":"115","author":"Bang-Jensen","year":"1996"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0012-365X(94)00188-O","article-title":"Weakly Hamiltonian-connected Ordinary-multipartite tournaments","volume":"138","author":"Bang-Jensen","year":"1995","journal-title":"Dicrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00300-L","article-title":"On k-strong and k-cyclic digraphs","volume":"162","author":"Bang-Jensen","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190200205","article-title":"Quasi-transitive digraphs","volume":"20","author":"Bang-Jensen","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(97)00179-9","article-title":"Kings in quasi-transitive digraphs","volume":"185","author":"Bang-Jensen","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB16","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0405027","article-title":"A polynomial Algorithm for the 2-path problem for semicomplete digraphs","volume":"5","author":"Bang-Jensen","year":"1992","journal-title":"Siam J. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB17","volume":"3","author":"Beineke","year":"1988"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB18","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homomorphim problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbarer graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungaricae"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB21","first-page":"1370","article-title":"Characterisation des graphes non orientes dont on peut orienter les aretes de maniere a obtenir le graphe d'une relation d'ordre","volume":"254","author":"Ghouila-Houri","year":"1962","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB22","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB23","doi-asserted-by":"crossref","unstructured":"Y. Guo, Strongly hamiltonian-connected locally semicomplete digraphs, J. Graph Theory 22, 65\u201373.","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<65::AID-JGT9>3.0.CO;2-J"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB24","article-title":"Locally semicomplete digraphs","author":"Guo","year":"1995"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(93)E0195-A","article-title":"Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs","volume":"141","author":"Gutin","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB26","first-page":"231","article-title":"Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs","volume":"10","author":"Gutin","year":"1994","journal-title":"Austr. J. Combin."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB27","doi-asserted-by":"crossref","unstructured":"P. Hell, J. Bang-Jensen, J. Huang, Local tournaments and proper circular arc graphs, in: T. Asano, T. Ibaraki, H. Imai, T. Nishizeko (Eds.), Algorithms, Lecture notes in Comp. Sci., vol 450, pp. 101\u2013108.","DOI":"10.1007\/3-540-52921-7_59"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB28","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1006\/jctb.1995.1016","article-title":"Structure theorems on local tournaments","volume":"63","author":"Huang","year":"1995","journal-title":"J. Combin. Theory B."},{"key":"10.1016\/S0012-365X(98)00194-0_BIB29","article-title":"Tournament-like oriented graphs","author":"Huang","year":"1992"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190060307","article-title":"A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular arc graphs, and nested interval graphs","volume":"6","author":"Skrien","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB31","series-title":"Graph Theory and Combinatorics","first-page":"305","article-title":"Connectivity in tournaments","author":"Thomassen","year":"1984"},{"key":"10.1016\/S0012-365X(98)00194-0_BIB32","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0012-365X(85)80022-4","article-title":"The 2-linkage problem for acyclic digraphs","volume":"55","author":"Thomassen","year":"1985","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001940?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001940?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:28:44Z","timestamp":1555968524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98001940"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00194-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}