{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_34","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"400-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Wegner\u2019s Conjecture on\u00a02-Distance Coloring"],"prefix":"10.1007","author":[{"given":"Junlei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuehua","family":"Bu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"Agnarsson, G., Halldorsson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16, 651\u2013662 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR2","unstructured":"Borodin, O.V., Broersma, H.J., Glebov, A., Heuvel, J.V.D.: Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM researches report 2002-05 (2002)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J., McGuinness, S.M., Molloy, Salavatipour, M.: Coloring of the square of planar graph. J. Graph Theory 42, 110\u2013124 (2003)","DOI":"10.1002\/jgt.10077"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy, M., Salavatipour, M.: A bound on the chromatic number of the square of a planar graph. J. Comb. Theory Ser. B. 94, 189\u2013213 (2005)","journal-title":"J. Comb. Theory Ser. B."},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ipl.2006.02.013","volume":"98","author":"M Montassier","year":"2006","unstructured":"Montassier, M., Raspaud, A.: A note on 2-facial coloring of plane graphs. Inf. Process. Lett. 98, 235\u2013241 (2006)","journal-title":"Inf. Process. Lett."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts, F.S.: T-colorings of graphs: recent results and open problems. Discrete Math. 93, 229\u2013245 (1991)","journal-title":"Discrete Math."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.dam.2017.12.041","volume":"243","author":"HM Song","year":"2018","unstructured":"Song, H.M., Lai, H.J.: Upper bounds of r-hued colorings of planar graphs. Discrete Appl. Math. 243, 262\u2013269 (2018)","journal-title":"Discrete Appl. Math."},{"key":"34_CR9","unstructured":"Thomasse, C.: Applications of Tutte cycles, Technical report, Technical University of Denmark (2001)"},{"key":"34_CR10","unstructured":"Wegner, G.: Graphs with given diameter and a coloring problem. Technical report, University of Dortmund (1977)"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10878-018-0285-7","volume":"36","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Bu, Y.: Minimum 2-distance coloring of planar graphs and channel assignment. J. Comb. Optim. 36(1), 55\u201364 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0285-7","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:47:23Z","timestamp":1641016043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","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":"OCS","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":"38","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":"61% - 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","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":"3","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)"}}]}}