{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:04:00Z","timestamp":1725487440284},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725879"},{"type":"electronic","value":"9783540725886"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72588-6_54","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T14:35:23Z","timestamp":1184596523000},"page":"329-333","source":"Crossref","is-referenced-by-count":0,"title":["Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"MingChu","family":"Li","sequence":"first","affiliation":[]},{"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with its applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with its applications. MacMillan, New York (1976)"},{"key":"54_CR2","volume-title":"Computers and Intractability-A Guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability-A Guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Computing\u00a05, 704\u2013714 (1976)","journal-title":"SIAM J. Computing"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0166-218X(99)00163-8","volume":"98","author":"M. Li","year":"2000","unstructured":"Li, M., Corneil, D.G., Mendelsohn, E.: Pancyclicity and NP-completeness in planar graphs. Discrete Applied Math.\u00a098, 219\u2013225 (2000)","journal-title":"Discrete Applied Math."},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Computer Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Computer Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72588-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:58:19Z","timestamp":1558468699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72588-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725879","9783540725886"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72588-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}