{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:37:33Z","timestamp":1743097053622,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_24","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"316-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connectivity Keeping Trees in\u00a02-Connected Graphs with Girth Conditions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4887-9179","authenticated-orcid":false,"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"24_CR1","first-page":"63","volume":"32","author":"G Chartrand","year":"1972","unstructured":"Chartrand, G., Kaigars, A., Lick, D.R.: Critically $$n$$-connected graphs. Proc. Am. Math. Soc. 32, 63\u201368 (1972)","journal-title":"Proc. Am. Math. Soc."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"5235","DOI":"10.1016\/j.disc.2009.03.037","volume":"309","author":"AA Diwan","year":"2009","unstructured":"Diwan, A.A., Tholiya, N.P.: Non-separating trees in connected graphs. Discrete Math. 309, 5235\u20135237 (2009)","journal-title":"Discrete Math."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.jctb.2007.11.001","volume":"98","author":"S Fujita","year":"2008","unstructured":"Fujita, S., Kawarabayashi, K.: Connectivity keeping edges in graphs with large minimum degree. J. Comb. Theory Ser. B 98, 805\u2013811 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1002\/jgt.22504","volume":"94","author":"T Hasunuma","year":"2020","unstructured":"Hasunuma, T., Ono, K.: Connectivity keeping trees in 2-connected graphs. J. Graph Theory 94, 20\u201329 (2020)","journal-title":"J. Graph Theory"},{"key":"24_CR5","first-page":"176","volume":"105","author":"SC Locke","year":"1998","unstructured":"Locke, S.C.: Problem 10647. MAA Mon. 105, 176 (1998)","journal-title":"MAA Mon."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"111677","DOI":"10.1016\/j.disc.2019.111677","volume":"343","author":"C Lu","year":"2020","unstructured":"Lu, C., Zhang, P.: Connectivity keeping trees in 2-connected graphs. Discrete Math. 343, 111677 (2020)","journal-title":"Discrete Math."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Lu, C., Ye, Q.: Connectivity keeping caterpillars in 2-connected graphs. Manuscript (2019)","DOI":"10.1016\/j.disc.2019.111677"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/jgt.20465","volume":"65","author":"W Mader","year":"2010","unstructured":"Mader, W.: Connectivity keeping paths in $$k$$-connected graphs. J. Graph Theory 65, 61\u201369 (2010)","journal-title":"J. Graph Theory"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1002\/jgt.20585","volume":"69","author":"W Mader","year":"2012","unstructured":"Mader, W.: Connectivity keeping trees in $$k$$-connected graphs. J. Graph Theory 69, 324\u2013329 (2012)","journal-title":"J. Graph Theory"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1016\/j.disc.2017.10.017","volume":"341","author":"Y Tian","year":"2018","unstructured":"Tian, Y., Meng, J., Lai, H.-J., Xu, L.: Connectivity keeping stars or double stars in 2-connected graphs. Discrete Math. 341, 1120\u20131124 (2018)","journal-title":"Discrete Math."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.disc.2018.10.001","volume":"342","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Xu, L., Meng, J., Lai, H.-J.: Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discrete Math. 342, 344\u2013351 (2019)","journal-title":"Discrete Math."},{"key":"24_CR12","doi-asserted-by":"publisher","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"WT Tutte","year":"1966","unstructured":"Tutte, W.T.: Connectivity in Graphs. Univ. of Toronto Press, Toronto (1966)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:15Z","timestamp":1710256635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}