{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:41Z","timestamp":1725663401953},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:19:26Z","timestamp":1330193966000},"page":"12-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for square roots of graphs"],"prefix":"10.1007","author":[{"given":"Yaw-Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. Aho","year":"1972","unstructured":"A. Aho, M. Garey, and J. Ullman. The transitive reduction of a directed graph. SIAM J. Computing, 1:131\u2013137, 1972.","journal-title":"SIAM J. Computing"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1017\/S0305004100041657","volume":"63","author":"M. Behzad","year":"1967","unstructured":"M. Behzad. A criterion for the planarity of a total graph. Proc. Cambridge Philos. Soc., 63:679\u2013681, 1967.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0095-8956(74)90074-4","volume":"16","author":"F. Escalante","year":"1974","unstructured":"F. Escalante, L. Montejano, and T. Rojano. Characterization of n-path graphs and of graphs having nth root. J. Combin. Theory B, 16:282\u2013289, 1974.","journal-title":"J. Combin. Theory B"},{"key":"3_CR4","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. Combin. Theory B, 16:29\u201334, 1974.","journal-title":"J. Combin. Theory B"},{"key":"3_CR5","volume-title":"Computers and Intractability \u2014 A guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability \u2014 A guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory B, 16:47\u201356, 1974.","journal-title":"J. Combin. Theory B"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/S0021-9800(68)80079-1","volume":"5","author":"D. P. Geller","year":"1968","unstructured":"D. P. Geller. The square root of a digraph. J. Combin. Theory, 5:320\u2013321, 1968.","journal-title":"J. Combin. Theory"},{"key":"3_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"3_CR9","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Massachusetts, 1972."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0021-9800(67)80050-4","volume":"2","author":"F. Harary","year":"1967","unstructured":"F. Harary, R. M. Karp, and W. T. Tutte. A criterion for planarity of the square of a graph. J. Combin. Theory, 2:395\u2013405, 1967.","journal-title":"J. Combin. Theory"},{"key":"3_CR11","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, 18:138\u2013140, 1971.","journal-title":"Mathematika"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/jgt.3190090415","volume":"9","author":"G. Hendry","year":"1985","unstructured":"G. Hendry and W. Vogler. The square of a connected S(K\n1,3)-free graph is vertex pancyclic. J. Graph Theory, 9:535\u2013537, 1985.","journal-title":"J. Graph Theory"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Computing, 2:135\u2013158, 1973.","journal-title":"SIAM J. Computing"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M. Matthews","year":"1984","unstructured":"M. Matthews and D. Summer. Hamiltonina results in S(K\n1,3)-free graphs. J. Graph Theory, 8:139\u2013146, 1984.","journal-title":"J. Graph Theory"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/S0021-9800(67)80030-9","volume":"2","author":"A. Mukhopadhyay","year":"1967","unstructured":"A. Mukhopadhyay. The square root of a graph. J. Combin. Theory, 2:290\u2013295, 1967.","journal-title":"J. Combin. Theory"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1002\/j.1538-7305.1960.tb03936.x","volume":"39","author":"I. C. Ross","year":"1960","unstructured":"I. C. Ross and F. Harary. The square of a tree. Bell System Tech. J., 39:641\u2013647, 1960.","journal-title":"Bell System Tech. J."},{"key":"3_CR17","unstructured":"M. Sekanina. On an ordering of the set of vertices of a connected graph. Technical Report No. 412, Publ. Fac. Sci. Univ. Brno, 1960."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:26:50Z","timestamp":1578508010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_44"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}