{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:24Z","timestamp":1725544884524},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_42","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"384-389","source":"Crossref","is-referenced-by-count":1,"title":["Edge Connectivity vs Vertex Connectivity in Chordal Graphs"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"42_CR1","unstructured":"G. Chartrand, F. Harary, Graphs with prescribed connectivities Theory of Graphs (P. Erdos and G. Katona, eds.) Akademiai Kiado, Budapest, 1968, 61\u201363."},{"key":"42_CR2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory. Addison-Wesley Reading, MA, 1969."},{"key":"42_CR3","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":"42_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-7091-9076-0_2","volume-title":"Computational Graph Theory","author":"R.H. Mohring","year":"1990","unstructured":"R.H. Mohring, Graph Problems Related To Gate Matrix Layout And PLA Folding. Computational Graph Theory, Pages 17\u201352, Springer, Wein, New York, 1990."},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis, Computing The Minimum Fill-in Is NP-Complete SIAM J. on Alge. Discre. Math. 2 77\u201379, 1981.","journal-title":"SIAM J. on Alge. Discre. Math"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, Congruent Graphs and the connectivity of graphs. American J. Math, 54, 1932, 150\u2013168","journal-title":"American J. Math"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:04:27Z","timestamp":1551045867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}