{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:47:44Z","timestamp":1778154464064,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00272-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"1-12","source":"Crossref","is-referenced-by-count":11,"title":["A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian"],"prefix":"10.1016","volume":"161","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00272-X_BIB1","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\/0012-365X(95)00272-X_BIB2","first-page":"41","article-title":"A tour through tournaments or bipartite and ordinary tournaments: a comparative survey","author":"Beineke","year":"1981","journal-title":"J. London Math. Soc. Lecture Notes Ser. No. 52"},{"key":"10.1016\/0012-365X(95)00272-X_BIB3","volume":"3","author":"Beineke","year":"1988"},{"key":"10.1016\/0012-365X(95)00272-X_BIB4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","article-title":"Disconnected orientations and a conjecture of Las Vergnas","volume":"14","author":"Bondy","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(95)00272-X_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"issue":"No. 1","key":"10.1016\/0012-365X(95)00272-X_BIB6","first-page":"99","article-title":"A criterion for complete bipartite digraphs to be Hamiltonian","author":"Gutin","year":"1984","journal-title":"Vestsi Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk"},{"issue":"No. 4","key":"10.1016\/0012-365X(95)00272-X_BIB7","first-page":"124","article-title":"Effective characterization of complete bipartite digraphs that have a Hamiltonian path","author":"Gutin","year":"1985","journal-title":"Kibernetica"},{"issue":"No. 1","key":"10.1016\/0012-365X(95)00272-X_BIB8","first-page":"107","article-title":"A characterization of complete n-partite digraphs that have a Hamiltonian path","author":"Gutin","year":"1988","journal-title":"Kibernetica"},{"key":"10.1016\/0012-365X(95)00272-X_BIB9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0406020","article-title":"Finding a longest path in a complete multipartite digraph","volume":"6","author":"Gutin","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(95)00272-X_BIB10","article-title":"Paths and cycles in digraphs","author":"Gutin","year":"1993"},{"key":"10.1016\/0012-365X(95)00272-X_BIB11","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190190405","article-title":"Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey","volume":"19","author":"Gutin","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00272-X_BIB12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02122681","article-title":"Cycles and paths in bipartite tournaments with spanning configurations","volume":"9","author":"H\u00e4ggkvist","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(95)00272-X_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(92)90233-Z","article-title":"A linear algorithm for finding Hamiltonian cycles in tournaments","volume":"36","author":"Manoussakis","year":"1992","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0012-365X(95)00272-X_BIB14","series-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/0012-365X(95)00272-X_BIB15","unstructured":"A. Yeo, One-diregular subgraphs in semicomplete multipartite digraphs, Journal of Graph Theory, to appear."},{"key":"10.1016\/0012-365X(95)00272-X_BIB16","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0167-5060(08)70486-2","article-title":"Hamilton paths in multipartite oriented graphs","volume":"41","author":"Zhang","year":"1989","journal-title":"Ann. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500272X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500272X?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:26:15Z","timestamp":1556130375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500272X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X9500272X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00272-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}