{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:54:29Z","timestamp":1649076869882},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T00:00:00Z","timestamp":1407456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1460-y","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T06:09:43Z","timestamp":1407391783000},"page":"1539-1554","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalizing Vertex Pancyclic and $$k$$ k -ordered Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Ruijuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoping","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,8]]},"reference":[{"key":"1460_CR1","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"1460_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press Ltd, London (1976)"},{"key":"1460_CR3","volume-title":"Graphs and Digraphs","author":"G Chartrand","year":"1996","unstructured":"Chartrand, G., Lesniak, L.: Graphs and Digraphs. Chapman and Hall, London (1996)"},{"issue":"1\u20133","key":"1460_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0012-365X(00)00202-8","volume":"229","author":"RJ Faudree","year":"2001","unstructured":"Faudree, R.J.: Survey of results on $$k$$ k -ordered graphs. Discrete Math. 229(1\u20133), 73\u201387 (2001)","journal-title":"Discrete Math."},{"issue":"3","key":"1460_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/jgt.10084","volume":"42","author":"RJ Faudree","year":"2003","unstructured":"Faudree, R.J., Gould, R.J., Kostochka, A.V., Lesniak, L., Schiermeyer, I., Saito, A.: Degree conditions for $$k$$ k -ordered hamiltonian graphs. J. Graph Theory 42(3), 199\u2013210 (2003)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1460_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00373-004-0576-x","volume":"20","author":"RJ Faudree","year":"2004","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Generalizing pancyclic and $$k$$ k -ordered graphs. Graphs Comb. 20(3), 291\u2013309 (2004)","journal-title":"Graphs Comb."},{"issue":"16","key":"1460_CR7","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.ipl.2010.05.017","volume":"110","author":"R Li","year":"2010","unstructured":"Li, R.: A Fan-type result on $$k$$ k -ordered graphs. Inf. Process. Lett. 110(16), 651\u2013654 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"1460_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.dam.2009.05.005","volume":"158","author":"R Li","year":"2010","unstructured":"Li, R., Li, S., Guo, Y.: Degree conditions on distance 2 vertices that imply $$k$$ k -ordered Hamiltonian. Discrete Appl. Math. 158(4), 331\u2013339 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"1460_CR9","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1016\/j.disc.2007.04.061","volume":"308","author":"K M\u00e9sz\u00e1ros","year":"2008","unstructured":"M\u00e9sz\u00e1ros, K.: On low degree $$k$$ k -ordered graphs. Discrete Math. 308(12), 2149\u20132155 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"1460_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J","volume":"24","author":"L Ng","year":"1997","unstructured":"Ng, L., Schultz, M.: $$k$$ k -ordered Hamiltonian graphs. J. Graph Theory 24(1), 45\u201357 (1997)","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-014-1460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1460-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1460-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:38Z","timestamp":1559055578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1460-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,8]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1460"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1460-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,8]]}}}