{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:40:13Z","timestamp":1779892813418,"version":"3.53.1"},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9255,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge\u2010disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamiltonian.<\/jats:p>","DOI":"10.1002\/jgt.3190050204","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T10:50:31Z","timestamp":1180176631000},"page":"145-157","source":"Crossref","is-referenced-by-count":51,"title":["Long paths and cycles in oriented graphs"],"prefix":"10.1002","volume":"5","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","article-title":"Longest paths in digraphs. Combinatorics 1979, proceedings of the Joint Canada\u2010France Combinatorial Colloquium","author":"Bermond J. C.","journal-title":"Ann Discrete Math."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"e_1_2_1_4_2","article-title":"Paths and cycles in oriented graphs. Combinatorics 1979, proceedings of the Joint Canada\u2010France Combinatorial Colloquium","author":"Jackson B.","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_5_2","unstructured":"J. W.Moon Topics in Tournaments. Holt Rinehart and Winston New York (1968)."},{"key":"e_1_2_1_6_2","unstructured":"C. St. J. A.Nash\u2010Williams Valency sequences which force graphs to have hamiltonian circuits: Interim Report. University of Waterloo Research Report (1969)."},{"key":"e_1_2_1_7_2","first-page":"23","volume-title":"On the number of hamiltonian cycles in tournaments","author":"Thomassen C."},{"key":"e_1_2_1_8_2","article-title":"Long cycles in digraphs","author":"Thomassen C.","journal-title":"J. London Math. Soc."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190050204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190050204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T06:28:07Z","timestamp":1699770487000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190050204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/jgt.3190050204"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190050204","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}