{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T05:59:58Z","timestamp":1698645598687},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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":[[2009,8]]},"DOI":"10.1007\/s00373-009-0842-z","type":"journal-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T14:40:39Z","timestamp":1250520039000},"page":"299-307","source":"Crossref","is-referenced-by-count":3,"title":["Each 3-strong Tournament Contains 3 Vertices Whose Out-arcs Are Pancyclic"],"prefix":"10.1007","volume":"25","author":[{"given":"Jinfeng","family":"Feng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,18]]},"reference":[{"key":"842_CR1","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)"},{"key":"842_CR2","unstructured":"Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C. R. Acad. Sci. Paris 249, 2151\u20132152 (1959)"},{"key":"842_CR3","unstructured":"Feng, J., Li, S., Li, R.: An s-strong tournament with s\u00a0\u2265\u00a0 3 has s\u00a0+\u00a01 vertices whose out-arcs are 4-pancyclic. Discrete Appl. Math. 154, 2609\u20132612 (2006)"},{"key":"842_CR4","unstructured":"Goldberg, M., Moon, J.W.: Cycles in k-strong tournaments. Pacific J. Math. 40, 89\u201396 (1972)"},{"key":"842_CR5","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":"842_CR6","unstructured":"Thomassen, C.: Hamiltonian-connected tournaments. J. Combin. Theory Ser. B 28, 142\u2013163 (1980)"},{"key":"842_CR7","unstructured":"Yao, T., Guo, Y., Zhang, K.: Pancyclic out-arcs of a vertex in a tournament. Discrete Appl. Math. 99, 245\u2013249 (2000)"},{"key":"842_CR8","doi-asserted-by":"crossref","unstructured":"Yeo, A.: The number of pancyclic arcs in a k-strong tournament. J. Graph Theory 50, 212\u2013219 (2005)","DOI":"10.1002\/jgt.20110"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0842-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0842-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0842-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0842-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["842"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0842-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}