{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T17:06:09Z","timestamp":1771866369563,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T00:00:00Z","timestamp":1361923200000},"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":[[2014,5]]},"DOI":"10.1007\/s00373-013-1296-x","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T11:33:47Z","timestamp":1361878427000},"page":"743-753","source":"Crossref","is-referenced-by-count":6,"title":["Removable Edges and Chords of Longest Cycles in 3-Connected Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Jichang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajo","family":"Broersma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,27]]},"reference":[{"key":"1296_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/jgt.20312","volume":"58","author":"E. Birmel\u00e9","year":"2008","unstructured":"Birmel\u00e9 E.: Every longest circuit of a 3-connected, K 3, 3-minor free graph has a chord. J. Graph Theory 58, 293\u2013298 (2008)","journal-title":"J. Graph Theory"},{"key":"1296_CR2","unstructured":"Bondy J.A.: Basic graph theory, in \u201cHandbook of Combinatorics\u201d, pp. 3\u2013110, North-Holland, Amsterdam, 1995"},{"key":"1296_CR3","doi-asserted-by":"crossref","unstructured":"Bondy J.A., Murty, U.S.R.: Graph theory, Springer graduate texts in mathematics, vol. 244 (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"1296_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/jgt.3190140410","volume":"14","author":"D.A. Holton","year":"1990","unstructured":"Holton D.A., Jackson B., Saito A., Wormald N.C.: Removable edges in 3-connected graphs. J. Graph Theory 14, 465\u2013473 (1990)","journal-title":"J. Graph Theory"},{"key":"1296_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejc.2005.07.017","volume":"28","author":"K.-I. Kawarabayashi","year":"2007","unstructured":"Kawarabayashi K.-I., Niu J., Zhang C.-Q.: Chords of longest circuits in locally planar graphs. Eur. J. Combin 28, 315\u2013321 (2007)","journal-title":"Eur. J. Combin"},{"key":"1296_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0012-365X(02)00688-X","volume":"268","author":"X. Li","year":"2003","unstructured":"Li X., Zhang C.-Q.: Chords of longest circuits in 3-connected graphs. Discrete Math. 268, 199\u2013206 (2003)","journal-title":"Discrete Math."},{"key":"1296_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10091","volume":"43","author":"X. Li","year":"2003","unstructured":"Li X., Zhang C.-Q.: Chords of longest circuits of graphs embedded in torus and Klein bottle. J. Graph Theory 43, 1\u201323 (2003)","journal-title":"J. Graph Theory"},{"key":"1296_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/jctb.1998.1864","volume":"75","author":"J.J. Su","year":"1999","unstructured":"Su J.J.: The number of removable edges in 3-connected graphs, J. Combin. Theory Ser. B 75, 74\u201387 (1999)","journal-title":"Combin. Theory Ser. B"},{"key":"1296_CR9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1360\/csb1999-44-9-921","volume":"44","author":"J.J. Su","year":"1999","unstructured":"Su J.J.: Removable edges of cycles in 3-connected graphs (in Chinese). Chin. Sci. Bull. 44, 921\u2013926 (1999)","journal-title":"Chin. Sci. Bull."},{"key":"1296_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1006\/jctb.1997.1776","volume":"71","author":"C. Thomassen","year":"1997","unstructured":"Thomassen C.: Chords of longest cycles in cubic graphs. J. Combin. Theory Ser B 71, 211\u2013214 (1997)","journal-title":"J. Combin. Theory Ser B"},{"key":"1296_CR11","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.3190110409","volume":"11","author":"C.-Q. Zhang","year":"1987","unstructured":"Zhang C.-Q.: Longest cycles and their chords. J. Graph Theory 11, 521\u2013529 (1987)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1296-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1296-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1296-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T21:45:25Z","timestamp":1595454325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1296-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,27]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1296"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1296-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,27]]}}}