{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T17:28:16Z","timestamp":1660411696287},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T00:00:00Z","timestamp":1334188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00373-012-1170-2","type":"journal-article","created":{"date-parts":[[2012,4,11]],"date-time":"2012-04-11T07:17:57Z","timestamp":1334128677000},"page":"1141-1149","source":"Crossref","is-referenced-by-count":1,"title":["Every Cycle-Connected Multipartite Tournament with \u03b4\u00a0\u2265 2 Contains At Least Two Universal Arcs"],"prefix":"10.1007","volume":"29","author":[{"given":"Qingsong","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunshu","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,12]]},"reference":[{"issue":"1","key":"1170_CR1","first-page":"1","volume":"14","author":"A. \u00c1d\u00e1m","year":"1999","unstructured":"\u00c1d\u00e1m A.: On some cyclic connectivity properties of directed graphs. Acta Cybernet. 14(1), 1\u201312 (1999)","journal-title":"Acta Cybernet."},{"key":"1170_CR2","volume-title":"Digraphs: Theory Algorithms and Applications","author":"J. Bang-Jensen","year":"2001","unstructured":"Bang-Jensen J., Gutin G.: Digraphs: Theory Algorithms and Applications. Springer, Berlin (2001)"},{"key":"1170_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0012-365X(96)00048-9","volume":"164","author":"Y. Guo","year":"1997","unstructured":"Guo Y., Pinkernell A., Volkmann L.: On cycles through a given vertex in multipartite tournaments. Discrete Math. 164, 165\u2013170 (1997)","journal-title":"Discrete Math."},{"issue":"2","key":"1170_CR4","first-page":"47","volume":"17","author":"G. Hetyei","year":"2001","unstructured":"Hetyei G.: Cyclic connectivity classes of directed graphs, Acta Math. Acad. Paedagog. Nyh\u00e1zi 17(2), 47\u201359 (2001)","journal-title":"Acad. Paedagog. Nyh\u00e1zi"},{"key":"1170_CR5","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1016\/j.disc.2007.03.054","volume":"308","author":"A. Hubenko","year":"2008","unstructured":"Hubenko A.: On a cyclic connectivity property of directed graphs. Discrete Math. 308, 1018\u20131024 (2008)","journal-title":"Discrete Math."},{"key":"1170_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.4153\/CMB-1966-038-7","volume":"9","author":"J.W. Moon","year":"1966","unstructured":"Moon J.W.: On subtournaments of a tournament. Can. Math. Bull. 9, 297\u2013301 (1966)","journal-title":"Can. Math. Bull."},{"key":"1170_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(01)00419-8","volume":"245","author":"L. Volkmann","year":"2002","unstructured":"Volkmann L.: Cycles in multipartite tournaments: results and problems. Discrete Math. 245, 19\u201353 (2002)","journal-title":"Discrete Math."},{"key":"1170_CR8","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/j.disc.2008.01.032","volume":"309","author":"L. Volkmann","year":"2009","unstructured":"Volkmann L., Winzen S.: Every cycle-connected multipartite tournament has a universal arc. Discrete Math. 309, 1013\u20131017 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1170-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1170-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1170-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1170-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1170"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1170-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,12]]}}}