{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:41:37Z","timestamp":1740120097965,"version":"3.37.3"},"reference-count":21,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11961051"],"award-info":[{"award-number":["11961051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF of Guangxi Province","award":["2018GXNSFAA050117"],"award-info":[{"award-number":["2018GXNSFAA050117"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:p> Yoshimi Egawa [8] showed that a 5-connected graph G admits at most [Formula: see text] 5-shredders. In this paper we shown that a contraction-critical 5-connected graph G admits at most [Formula: see text] 5-shredders. Further we show that, for every contraction-critical 5-connected graph G, there is a contraction critical 5-connected graph [Formula: see text] such that G is a spanning subgraph of [Formula: see text] and [Formula: see text] admits at most [Formula: see text] 5-shredders. <\/jats:p>","DOI":"10.1142\/s0129626420400083","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T07:38:43Z","timestamp":1602574723000},"page":"2040008","source":"Crossref","is-referenced-by-count":0,"title":["5-Shredders of Contraction-Critical 5-Connected Graphs"],"prefix":"10.1142","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0512-0397","authenticated-orcid":false,"given":"Chengfu","family":"Qin","sequence":"first","affiliation":[{"name":"School of Mathematics and statistics, Nanning Normal University, 530001, Nanning, Guangxi, P. R. China"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, 030024, Taiyuan, Shanxi, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,10,12]]},"reference":[{"key":"S0129626420400083BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"first-page":"37","volume-title":"Proc. 28th Ann. ACM STOC","author":"Cheriyan J.","key":"S0129626420400083BIB002"},{"first-page":"698","volume-title":"Proc. 31th Annual IEEE Symp. on Foundations of Comput. Sci.","author":"Naor D.","key":"S0129626420400083BIB003"},{"first-page":"548","volume-title":"Proc. 32th Annual IEEE Symp. on Foundations of Comput. Sci.","author":"Hsu T. S.","key":"S0129626420400083BIB004"},{"key":"S0129626420400083BIB005","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1077"},{"key":"S0129626420400083BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/0222056"},{"key":"S0129626420400083BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.02.028"},{"key":"S0129626420400083BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20336"},{"key":"S0129626420400083BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<195::AID-JGT4>3.0.CO;2-E"},{"key":"S0129626420400083BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90277-O"},{"key":"S0129626420400083BIB011","first-page":"12","volume":"3","author":"Su J. J.","year":"1997","journal-title":"J. Guangxi Normal University"},{"key":"S0129626420400083BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.10.041"},{"key":"S0129626420400083BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-017-1830-3"},{"key":"S0129626420400083BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.10.022"},{"key":"S0129626420400083BIB015","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006601"},{"key":"S0129626420400083BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200000"},{"key":"S0129626420400083BIB017","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20131"},{"key":"S0129626420400083BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90216-6"},{"key":"S0129626420400083BIB019","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2024"},{"key":"S0129626420400083BIB020","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705047"},{"key":"S0129626420400083BIB021","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700182"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626420400083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T07:38:58Z","timestamp":1602574738000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626420400083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":21,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["10.1142\/S0129626420400083"],"URL":"https:\/\/doi.org\/10.1142\/s0129626420400083","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}