{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:21:28Z","timestamp":1760188888356},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"DOI":"10.1007\/s00373-006-0665-0","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T11:06:11Z","timestamp":1176894371000},"page":"165-182","source":"Crossref","is-referenced-by-count":8,"title":["Subdivision Extendibility"],"prefix":"10.1007","volume":"23","author":[{"given":"Ronald","family":"Gould","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thor","family":"Whalen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"665_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory, Discrete Math. 15(2), 111\u2013135 (1976)","DOI":"10.1016\/0012-365X(76)90078-9"},{"key":"665_CR2","doi-asserted-by":"crossref","unstructured":"Brandt, S., Chen, G., Faudree, R., Gould, R.J., Lesniak, L.: Degree conditions for 2-factors, J. Graph Theory 24(2), 165\u2013173 (1997)","DOI":"10.1002\/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O"},{"key":"665_CR3","unstructured":"Chartrand, G.,Lesniak, L.: Graphs & digraphs, 3rd edn. Chapman & Hall, London, (1996)"},{"key":"665_CR4","unstructured":"Chen, G., Gould, R.J., Pfender, F.: New conditions for k-ordered Hamiltonian graphs, Ars Combin. 70, 245\u2013255 (2004)"},{"key":"665_CR5","unstructured":"Dirac, G.A.: Some theorems on abstract graphs, Proc. London Math. Soc. 2, 69\u201381 (1952)"},{"key":"665_CR6","unstructured":"Dirac, G.: G\u00e9n\u00e9ralisations du th\u00e9or\u00e8me de Menger, C. R. Acad. Sci. Paris 250, 4252\u20134253 (1960)"},{"key":"665_CR7","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Faudree, R.J., Gyori, E., Ishigami, Y., Shelp, R., Hong, W.: Vertex-disjoint cycles containing specified edges, Graphs Combin. 16(1), 81\u201392 (2000)","DOI":"10.1007\/s003730050005"},{"key":"665_CR8","doi-asserted-by":"crossref","unstructured":"Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L. On k-ordered graphs, J. Graph Theory 35(2), 69\u201382 (2000)","DOI":"10.1002\/1097-0118(200010)35:2<69::AID-JGT1>3.0.CO;2-I"},{"key":"665_CR9","unstructured":"Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L., Pfender, F.: Linear forests and ordered cycles, Dis. Math. Graph Theory 24, 359\u2013372 (2004)"},{"key":"665_CR10","doi-asserted-by":"crossref","unstructured":"Faudree, R.J.: Survey of reslts on k-ordered graphs, Discrete Math. 229(1\u20133), 73\u201387 (2001)","DOI":"10.1016\/S0012-365X(00)00202-8"},{"key":"665_CR11","doi-asserted-by":"crossref","unstructured":"Ferrara, M., Gould, R., Tansey, G., Whalen, T.: On H-linked graphs, Graphs Combin. 11(2), 217\u2013224 (2006)","DOI":"10.1007\/s00373-006-0651-6"},{"key":"665_CR12","unstructured":"Gould, R., Whalen, T.: Distance between two k-sets and path-systems extendibility, Ars Combin. 79, 211\u2013228 (2006)"},{"key":"665_CR13","doi-asserted-by":"crossref","unstructured":"Justesen, P.: On independent circuits in finite graphs and a conjecture of Erd\u0151s and P\u00f3sa, Graph theory in memory of G. A. Dirac (Sandbjerg, 1985), Ann. Discrete Math. 41, 299\u2013305 (1989)","DOI":"10.1016\/S0167-5060(08)70467-9"},{"key":"665_CR14","doi-asserted-by":"crossref","unstructured":"Ng, L., Schultz, M.: k-ordered Hamiltonian graphs, J. Graph Theory 24(1), 45\u201357 (1997)","DOI":"10.1002\/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J"},{"key":"665_CR15","doi-asserted-by":"crossref","unstructured":"Ore, O.: Note on Hamilton circuits, Amer. Math. Monthly 67, 55\u201355 (1960)","DOI":"10.2307\/2308928"},{"key":"665_CR16","unstructured":"Ore, O.: Hamiltonian connected graphs, J. Math. Pures Appl. 42, 21\u201327 (1963)"},{"key":"665_CR17","unstructured":"Whitney, H.: Non-separable and planar graphs, Trans. Amer. Math. Soc. 34(2), 339\u2013362 (1932)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0665-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0665-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0665-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:26Z","timestamp":1559055506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0665-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0665-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}