{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:12:01Z","timestamp":1648858321606},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"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":[[2008,11]]},"DOI":"10.1007\/s00373-008-0809-5","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T09:27:42Z","timestamp":1228123662000},"page":"495-509","source":"Crossref","is-referenced-by-count":0,"title":["Degree Condition for Subdivisions of Unicyclic Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Ch. Sobhan","family":"Babu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajit A.","family":"Diwan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"809_CR1","unstructured":"Brandt, S.: Subtrees and Subforests of Graphs. J. Combin Theory Ser. B 61, 63\u201370 (1994)"},{"key":"809_CR2","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the Maximal Number of Independent Circuits in a Graph. Acta Math. Acad. Sci. Hungar. 14, 423\u2013439 (1963)"},{"key":"809_CR3","doi-asserted-by":"crossref","unstructured":"Enomoto, H.: On the Existence of Disjoint Cycles in a Graph. Combinatorica 18, 487\u2013492 (1998)","DOI":"10.1007\/s004930050034"},{"key":"809_CR4","doi-asserted-by":"crossref","unstructured":"Schuster, G.W.: A Minimum Degree Result for Disjoint Cycles and Forests in Graphs. Combinatorica 18, 425\u2013436 (1998)","DOI":"10.1007\/PL00009831"},{"key":"809_CR5","unstructured":"Bondy, J.A.: Paths and Cycles, Handbook of Combinatorics, Vol. 1, Chapter 1, Ed. R.L. Graham, M. Grotschel and L. Lov\u00e1sz (Elsevier, Amsterdam, 1995)"},{"key":"809_CR6","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. (North Holland, New York, 1976)","DOI":"10.1007\/978-1-349-03521-2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0809-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0809-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0809-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0809-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0809-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}