{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:14:11Z","timestamp":1649002451346},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,6,15]],"date-time":"2013-06-15T00:00:00Z","timestamp":1371254400000},"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":[[2014,9]]},"DOI":"10.1007\/s00373-013-1328-6","type":"journal-article","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T10:12:41Z","timestamp":1371204761000},"page":"1163-1173","source":"Crossref","is-referenced-by-count":1,"title":["The Number of Out-Pancyclic Vertices in a Strong Tournament"],"prefix":"10.1007","volume":"30","author":[{"given":"Qiaoping","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengjia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiling","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,15]]},"reference":[{"key":"1328_CR1","unstructured":"Bang-Jensen, J.; Gutin, G.: Digraphs: theory, algorithms and applications. Springer, London (2000)"},{"key":"1328_CR2","first-page":"2151","volume":"249","author":"P. Camion","year":"1959","unstructured":"Camion P.: Chemins et circuits hamiltoniens des graphes complets. C.R. Acad. Sci. Paris. 249, 2151\u20132152 (1959)","journal-title":"C.R. Acad. Sci. Paris."},{"key":"1328_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00373-009-0842-z","volume":"25","author":"J. Feng","year":"2009","unstructured":"Feng J.: Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic. Graphs Combin. 25, 299\u2013307 (2009)","journal-title":"Graphs Combin."},{"key":"1328_CR4","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.dam.2010.01.012","volume":"158","author":"Q. Guo","year":"2010","unstructured":"Guo Q., Li S., Guo Y., Li H.: Out-arc pancyclicity of vertices in tournaments. Discrete Appl. Math. 158, 996\u20131005 (2010)","journal-title":"Discrete Appl. Math."},{"key":"1328_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.20018","volume":"47","author":"F. Havet","year":"2004","unstructured":"Havet F.: Pancyclic arcs and connectivity in tournaments. J. Graph Theory. 47, 87\u2013110 (2004)","journal-title":"J. Graph Theory."},{"key":"1328_CR6","unstructured":"Li, R., Li, S., Feng, J.: The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. Discrete Appl. Math. 156, 88\u201392 (2008)"},{"key":"1328_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(80)90061-1","volume":"28","author":"C. Thomassen","year":"1980","unstructured":"Thomassen C.: Hamiltonian-connected tournaments. J. Combin. Theory Ser. B. 28, 142\u2013163 (1980)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1328_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0166-218X(99)00136-5","volume":"99","author":"T. Yao","year":"2000","unstructured":"Yao T., Guo Y., Zhang K.: Pancyclic out-arcs of a vertex in a tournament. Discrete Appl. Math. 99, 245\u2013249 (2000)","journal-title":"Discrete Appl. Math."},{"key":"1328_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1002\/jgt.20110","volume":"50","author":"A. Yeo","year":"2005","unstructured":"Yeo A.: The number of pancyclic arcs in a k-strong tournament. J. Graph Theory. 50, 212\u2013219 (2005)","journal-title":"J. Graph Theory."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1328-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1328-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1328-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:36Z","timestamp":1559055576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1328-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,15]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["1328"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1328-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,15]]}}}