{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:33:36Z","timestamp":1648866816977},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,16]],"date-time":"2014-06-16T00:00:00Z","timestamp":1402876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00493-014-2899-4","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T05:25:31Z","timestamp":1403155531000},"page":"547-559","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The circumference of the square of a connected graph"],"prefix":"10.1007","volume":"34","author":[{"given":"Stephan","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Janina","family":"M\u00fcttel","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"2899_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory, Springer, 2010."},{"key":"2899_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","volume":"16","author":"H. Fleischner","year":"1974","unstructured":"H. Fleischner: The square of every two-connected graph is Hamiltonian, J. Comb. Theory, Ser. B 16 (1974), 29\u201334.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"2899_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01305995","volume":"82","author":"H. Fleischner","year":"1976","unstructured":"H. Fleischner: In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts, Monatsh. Math. 82 (1976), 125\u2013149.","journal-title":"Monatsh. Math."},{"key":"2899_CR4","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C.h. Golumbic","year":"2004","unstructured":"M. Ch. Golumbic: Algorithmic graph theory and perfect graphs, Elsevier, Amsterdam, 2004."},{"key":"2899_CR5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1112\/S0025579300008494","volume":"18","author":"F. Harary","year":"1971","unstructured":"F. Harary and A. Schwenk: Trees with Hamiltonian square, Mathematika, Lond. 18 (1971), 138\u2013140.","journal-title":"Mathematika, Lond."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2899-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2899-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2899-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:50Z","timestamp":1559079170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2899-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["2899"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2899-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]}}}