{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:47:43Z","timestamp":1778154463319,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00219-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"101-114","source":"Crossref","is-referenced-by-count":40,"special_numbering":"C","title":["A classification of locally semicomplete digraphs"],"prefix":"10.1016","volume":"167-168","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"given":"Yubao","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00219-1_BIB1","first-page":"13","article-title":"A note on the number of 4-circuits in a tournament","volume":"12","author":"Alspach","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00219-1_BIB2","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(96)00219-1_BIB3","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(96)00219-1_BIB4","unstructured":"J. Bang-Jensen, A reformulation of Huang's structure theorem for local tournaments with some consequences, unpublished manuscript."},{"key":"10.1016\/S0012-365X(96)00219-1_BIB5","doi-asserted-by":"crossref","unstructured":"J. Bang-Jensen, G. Gutin and H. Li, Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theory, to appear.","DOI":"10.1002\/(SICI)1097-0118(199606)22:2<181::AID-JGT9>3.0.CO;2-J"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB6","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(96)00219-1_BIB7","first-page":"141","article-title":"Optimal recognition of local tournaments","volume":"100","author":"Bang-Jensen","year":"1994"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1137\/S0895480192242754","article-title":"A linear algorithm for maximum weight cliques in proper circular arc graphs","volume":"9","author":"Bhattacharya","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00219-1_BIB9","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB10","unstructured":"Y.H. Bu and K.M. Zhang, Arc-pancyclicity of local tournaments, submitted."},{"key":"10.1016\/S0012-365X(96)00219-1_BIB11","series-title":"Integer Programming and Combinatorial Optimization, Proc. 2nd IPCO Conf.","first-page":"114","article-title":"Recognition and representation of proper circular arc graphs","author":"Deng","year":"1992"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB12","article-title":"Locally semicomplete digraphs","author":"Guo","year":"1995"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB13","series-title":"Pancyclic locally semicomplete digraphs","author":"Guo","year":"1992"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190180306","article-title":"Connectivity properties of locally semicomplete digraphs","volume":"18","author":"Guo","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(93)E0099-P","article-title":"On complementary cycles in locally semicomplete digraphs","volume":"135","author":"Guo","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00219-1_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<121::AID-JGT2>3.0.CO;2-T","article-title":"Locally semicomplete digraphs that are complementary m-pancyclic","volume":"21","author":"Guo","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB17","first-page":"101","article-title":"Local tournaments and proper circular arc graphs","volume":"Vol. 450","author":"Hell","year":"1991"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB18","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/jgt.3190200312","article-title":"Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs","volume":"20","author":"Hell","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB19","article-title":"Tournament-like oriented graphs","author":"Huang","year":"1992"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB20","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1006\/jctb.1995.1016","article-title":"On the structure of local tournaments","volume":"63","author":"Huang","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB21","series-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/S0012-365X(96)00219-1_BIB22","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(96)00219-1_BIB23","first-page":"186","article-title":"On locally semicomplete digraphs","volume":"20","author":"Zhang","year":"1996","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:50Z","timestamp":1556130470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":23,"alternative-id":["S0012365X96002191"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00219-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}