{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:25:09Z","timestamp":1648841109175},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T00:00:00Z","timestamp":1185926400000},"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,8]]},"DOI":"10.1007\/s00373-007-0736-x","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T13:03:06Z","timestamp":1185541386000},"page":"387-399","source":"Crossref","is-referenced-by-count":0,"title":["Local Topological Toughness and Local Factors"],"prefix":"10.1007","volume":"23","author":[{"given":"Frank","family":"G\u00f6ring","sequence":"first","affiliation":[]},{"given":"Gyula Y.","family":"Katona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"736_CR1","unstructured":"Chv\u00e1tal, V.: Tough graphs and hamiltonian circuits. Disc. Math. 5, 215\u2013228 (1973)"},{"key":"736_CR2","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory (Springer, 2000) Graduate Texts in Mathematics 173 (2000)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"736_CR3","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: 4-chromatische Graphen und vollst\u00e4ndige 4-Graphen. Math. Nachrichten 22, 51\u201360 (1960)","DOI":"10.1002\/mana.19600220106"},{"key":"736_CR4","doi-asserted-by":"crossref","unstructured":"Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of k-factors. J. Graph Theory 9, 87\u201395 (1985)","DOI":"10.1002\/jgt.3190090106"},{"key":"736_CR5","unstructured":"Gerlach, T., G\u00f6ring, F., Harant, J., Tk\u00e1\u010d, M.: On cycles through specified vertices. Disc. Math. 306, 831\u2013835 (2006)"},{"key":"736_CR6","unstructured":"G\u00f6ring, F., Harant, J., Hexel, E., Tuza, Zs.: On short cycles through prescribed vertices of a graph. Disc. Math. 286, 67\u201374 (2004)"},{"key":"736_CR7","unstructured":"Harant, J.: On paths and cycles through specified vertices. Disc. Math. 286, 95\u201398 (2004)"},{"key":"736_CR8","doi-asserted-by":"crossref","unstructured":"Katona, G.Y.: Toughness and edge-toughness. Disc. Math. 164(1\u20133), 187\u2013196 (1997)","DOI":"10.1016\/S0012-365X(96)00051-9"},{"key":"736_CR9","doi-asserted-by":"crossref","unstructured":"Katona, G.Y.: Properties of edge-tough graphs. Graphs Comb. 15(3), 205\u2013212 (1999)","DOI":"10.1007\/s003730050065"},{"key":"736_CR10","unstructured":"Kelmans, A.K., Lomonosov, M.V.: When m vertices in a k-connected graph cannot be walked round along a simple cycle. Disc. Math. 38, 53\u201362 (1982)"},{"key":"736_CR11","unstructured":"Lomonosov, M.V.: Cycles through prescribed elements in a graph. In Paths, Flows, and VLSI-Layout (Bonn, 1988), pp. 215\u2013234; Algorithms and Combinatorica, vol. 9, Springer, Berlin, 1990"},{"key":"736_CR12","unstructured":"Mader, W.: \u00dcber die Maximalzahl kreuzungsfreier H-Wege. Arch. Math. 31, 387\u2013402 (1978)"},{"key":"736_CR13","doi-asserted-by":"crossref","unstructured":"Mader, W.: \u00dcber ein graphentheoretisches Problem von T.Gallai. Arch. Math. 33, 239\u2013257 (1979)","DOI":"10.1007\/BF01222754"},{"key":"736_CR14","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96\u2013115 (1927)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0736-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0736-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0736-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0736-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["736"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0736-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}