{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:16Z","timestamp":1759638016439,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"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_19","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"251-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Equitable d-degenerate Choosability of\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6229-177X","authenticated-orcid":false,"given":"Ewa","family":"Drgas-Burchardt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8057-4108","authenticated-orcid":false,"given":"Hanna","family":"Furma\u0144czyk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7774-0512","authenticated-orcid":false,"given":"El\u017cbieta","family":"Sidorowicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"19_CR2","volume-title":"Graph Theory. Graduate Texts in Mathematics","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 2nd edn. Springer, New York (2000)","edition":"2"},{"issue":"18","key":"19_CR3","doi-asserted-by":"publisher","first-page":"6353","DOI":"10.2298\/FIL1818353D","volume":"32","author":"E Drgas-Burchardt","year":"2018","unstructured":"Drgas-Burchardt, E., Dybizba\u0144ski, J., Furma\u0144czyk, H., Sidorowicz, E.: Equitable list vertex colourability and arboricity of grids. Filomat 32(18), 6353\u20136374 (2018)","journal-title":"Filomat"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Drgas-Burchardt, E., Furma\u0144czyk, H., Sidorowicz, E.: Equitable $$d$$-degenerate choosability of graphs. arxiv:2003.09722 (2020)","DOI":"10.1007\/978-3-030-48966-3_19"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/jgt.10137","volume":"44","author":"AV Kostochka","year":"2003","unstructured":"Kostochka, A.V., Pelsmajer, M.J., West, D.B.: A list analogue of equitable colouring. J. Graph Theory 44(3), 166\u2013177 (2003)","journal-title":"J. Graph Theory"},{"key":"19_CR6","first-page":"297","volume":"329","author":"H Lei","year":"2018","unstructured":"Lei, H., Li, T., Ma, Y., Wang, H.: Analyzing lattice networks through substructures. Appl. Math. Comput. 329, 297\u2013314 (2018)","journal-title":"Appl. Math. Comput."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ijthermalsci.2015.10.040","volume":"102","author":"T Miao","year":"2016","unstructured":"Miao, T., Chen, A., Xu, Y.: Optimal structure of damaged tree-like branching networks for the equivalent thermal conductivity. Int. J. Therm. Sci. 102, 89\u201399 (2016)","journal-title":"Int. J. Therm. Sci."},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2232","author":"JA Mudrock","year":"2019","unstructured":"Mudrock, J.A., Chase, M., Thornburgh, E., Kadera, I., Wagstrom, T.: A note on the equitable choosability of complete bipartite graphs. DMGT (2019). https:\/\/doi.org\/10.7151\/dmgt.2232","journal-title":"DMGT"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20011","volume":"47","author":"MJ Pelsmajer","year":"2004","unstructured":"Pelsmajer, M.J.: Equitable list-colouring for graphs of maximum degree 3. J. Graph Theory 47(1), 1\u20138 (2004)","journal-title":"J. Graph Theory"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2298\/FIL1602373Z","volume":"30","author":"X Zhang","year":"2016","unstructured":"Zhang, X.: Equitable list point arboricity of graphs. Filomat 30(2), 373\u2013378 (2016)","journal-title":"Filomat"},{"key":"19_CR11","unstructured":"Zhang, X., Niu, B., Li, Y., Li, B.: Equitable vertex arboricity of $$d$$-degenerate graphs. arxiv: 1908.05066v1 (2019)"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:16:37Z","timestamp":1710256597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_19","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"}]}}