{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:53:39Z","timestamp":1648889619655},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010,1]]},"DOI":"10.1007\/s00373-010-0873-5","type":"journal-article","created":{"date-parts":[[2010,2,17]],"date-time":"2010-02-17T05:18:57Z","timestamp":1266383937000},"page":"119-131","source":"Crossref","is-referenced-by-count":0,"title":["The 3-Connected Graphs with Exactly k Non-Essential Edges"],"prefix":"10.1007","volume":"26","author":[{"given":"Yuxing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,18]]},"reference":[{"key":"873_CR1","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1979","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London (1979)"},{"key":"873_CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"64","author":"W.T. Tutte","year":"1961","unstructured":"Tutte W.T.: A theory of 3-connected graphs. Nederl. Wetensch. Proc. Ser. A 64, 441\u2013455 (1961)","journal-title":"Nederl. Wetensch. Proc. Ser. A"},{"key":"873_CR3","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1006\/eujc.2000.0407","volume":"21","author":"J.G. Oxley","year":"2000","unstructured":"Oxley J.G., Wu H.: On the structure of 3-connected matroids and graphs. Eur. J. Comb. 21, 667\u2013688 (2000)","journal-title":"Eur. J. Comb."},{"key":"873_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00373-004-0552-5","volume":"20","author":"J.G. Oxley","year":"2004","unstructured":"Oxley J.G., Wu H.: The 3-connected graphs with exactly three non-essential edges 3-connected graphs. Graphs Comb. 20, 233\u2013246 (2004)","journal-title":"Graphs Comb."},{"key":"873_CR5","first-page":"3","volume":"20","author":"T.J. Reid","year":"1992","unstructured":"Reid T.J., Wu H.: A non-planar version of Tutt\u2019s wheels theorem. Australas. J. Comb. 20, 3\u201312 (1992)","journal-title":"Australas. J. Comb."},{"key":"873_CR6","unstructured":"Liu, Y.X., Su, J.J.: Minimally 3-connected graphs with exactly k non-essential edges. J. Math. Res. Exposition 26, 835\u2013842 (2006) (In Chinese)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0873-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0873-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0873-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0873-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}