{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T18:19:21Z","timestamp":1698257961110},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01195323","type":"journal-article","created":{"date-parts":[[2005,2,26]],"date-time":"2005-02-26T02:25:26Z","timestamp":1109384726000},"page":"3-17","source":"Crossref","is-referenced-by-count":5,"title":["Long paths and cycles in tough graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"H. J.","family":"Broersma","sequence":"first","affiliation":[]},{"given":"J.","family":"van den Heuvel","sequence":"additional","affiliation":[]},{"given":"H. A.","family":"Jung","sequence":"additional","affiliation":[]},{"given":"H. J.","family":"Veldman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bondy, J.A. (to be published): Paths and cycles. In: R.L. Graham, M. Gr\ufffdtschel, L. Lov\ufffdsz (eds) Handbook of Combinatorics, North-Holland"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.4153\/CJM-1980-102-7","volume":"32","author":"J.A. Bondy","year":"1980","unstructured":"Bondy, J.A., Entringer, R.C. (1980): Longest cycles in 2-connected graphs with prescribed maximum degree. Can. J. Math.32, 1325?1332 (1980)","journal-title":"Can. J. Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(81)90159-X","volume":"33","author":"J.A. Bondy","year":"1981","unstructured":"Bondy, J.A., Locke, S.C.: Relative lengths of paths and cycles in 3-connected graphs. Discrete Math.33, 111?122 (1981)","journal-title":"Discrete Math."},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications. London: Macmillan, New York, Elsevier 1976"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\ufffdtal","year":"1973","unstructured":"Chv\ufffdtal, V.: Tough graphs and hamiltonian circuits. Discrete Math.5, 215?228 (1973)","journal-title":"Discrete Math."},{"issue":"3","key":"CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. (3)2, 69?81 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","volume":"9","author":"H. Enomoto","year":"1985","unstructured":"Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence ofk-factors. J. Graph Theory9, 87?95 (1985).","journal-title":"J. Graph Theory"},{"key":"CR8","unstructured":"Lang, R., Walther, H.: \ufffdber l\ufffdngste Kreise in regul\ufffdren Graphen. In: H. Sachs, H.-J. Vo\ufffd, H. Walther (eds) Beitr\ufffdge zur Graphentheorie. Teubner Verlagsgesellschaft, pp. 91?98 (1968)"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0095-8956(82)90036-3","volume":"32","author":"S.C. Locke","year":"1982","unstructured":"Locke, S.C.: Relative lengths of paths and cycles ink-connected graphs. J. Comb. Theory [B]32, 206?222 (1982)","journal-title":"J. Comb. Theory [B]"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M.M. Matthews","year":"1984","unstructured":"Matthews, M.M., Sumner, D.P.: Hamiltonian results inK 1,3-free graphs. J. Graph Theory8, 139?146 (1984)","journal-title":"J. Graph Theory"},{"key":"CR11","volume-title":"Cycles and bridges, in graphs","author":"H.-J. Vo\ufffd","year":"1991","unstructured":"Vo\ufffd, H.-J.: Cycles and bridges, in graphs. Kluwer, Dordrecht; Deutscher Verlag der Wissenschaften, Berlin (1991)"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S. Win","year":"1989","unstructured":"Win, S.: On a connection between the existence of k-trees and the toughness of a graph. Graphs and Combinatorics5, 201?205 (1989)","journal-title":"Graphs and Combinatorics"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01195323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:09:50Z","timestamp":1556629790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01195323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01195323"],"URL":"https:\/\/doi.org\/10.1007\/bf01195323","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}