{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T19:26:14Z","timestamp":1699989974149},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"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":[[2006,6]]},"DOI":"10.1007\/s00373-006-0651-6","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T04:06:47Z","timestamp":1152072407000},"page":"217-224","source":"Crossref","is-referenced-by-count":19,"title":["On H-Linked Graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Michael","family":"Ferrara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard","family":"Tansey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thor","family":"Whalen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"651_CR1","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 3rd edn. Chapman & Hall, London, 1996"},{"key":"651_CR2","doi-asserted-by":"crossref","unstructured":"Jung, H.A.: Eine verallgemeinerung des n-fachen zusammenhangs f\u00fcr graphen. Math Ann 187, 95\u2013103 (1970)","DOI":"10.1007\/BF01350174"},{"key":"651_CR3","unstructured":"Gould, R.J., Whalen, T.: Subdivision extendability. Graph and Combinatorics (to appear)"},{"key":"651_CR4","unstructured":"Kostochka, A., Yu, G.: An extremal problem for H-linked graphs. J. Graph Theory (to appear)"},{"key":"651_CR5","doi-asserted-by":"crossref","unstructured":"Mader, W.: Topological minors in graphs of minimum degree n. Contemporary trends in discrete mathematics (\u0160ti\u0159in Castle, 1997), 199\u2013211, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49, Amer. Math. Soc., Providence, RI, 1999","DOI":"10.1090\/dimacs\/049\/14"},{"key":"651_CR6","doi-asserted-by":"crossref","unstructured":"Thomas, R., Wollen, P.: An improved bound for graph linkage. European J. Combinatorics 26, 309\u2013324 (2005)","DOI":"10.1016\/j.ejc.2004.02.013"},{"key":"651_CR7","unstructured":"Whalen, T.: Degree conditions and relations to distance, extendability, and levels of connectivity in graphs. Ph.D. Thesis, Emory University, August, 2003"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0651-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0651-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0651-6","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-0651-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0651-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}