{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:07Z","timestamp":1780783147530,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_35","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:46Z","timestamp":1780780426000},"page":"500-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds on\u00a0Proper Conflict-Free Coloring of\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Ankit","family":"Sharma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaustav","family":"Paul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7151\/dmgt.2371","volume":"43","author":"A Aashtab","year":"2023","unstructured":"Aashtab, A., Akbari, S., Ghanbari, M., Shidani, A.: Vertex partitioning of graphs into odd induced subgraphs. Discuss. Math. Graph Theory 43(2), 385\u2013399 (2023)","journal-title":"Discuss. Math. Graph Theory"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.dam.2025.06.026","volume":"377","author":"J Ahn","year":"2025","unstructured":"Ahn, J., Im, S., Oum, S.-I.: The proper conflict-free k-coloring problem and the odd k-coloring problem are np-complete on bipartite graphs. Discret. Appl. Math. 377, 10\u201317 (2025)","journal-title":"Discret. Appl. Math."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2017.06.013","volume":"230","author":"G Bagan","year":"2017","unstructured":"Bagan, G., Merouane, H.B., Haddad, M., Kheddouci, H.: On some domination colorings of graphs. Discret. Appl. Math. 230, 34\u201350 (2017)","journal-title":"Discret. Appl. Math."},{"key":"35_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2025.115080","volume":"1031","author":"S Bhyravarapu","year":"2025","unstructured":"Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. Theoret. Comput. Sci. 1031, 115080 (2025)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113221","volume":"346","author":"Y Caro","year":"2023","unstructured":"Caro, Y., Petru\u0161evski, M., \u0160krekovski, R.: Remarks on proper conflict-free colorings of graphs. Discret. Math. 346(2), 113221 (2023)","journal-title":"Discret. Math."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2024.11.016","volume":"362","author":"E-K Cho","year":"2025","unstructured":"Cho, E.-K., Choi, I., Kwon, H., Park, B.: Proper conflict-free coloring of sparse graphs. Discret. Appl. Math. 362, 34\u201342 (2025)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discret. Math. 10(3), 399\u2013430 (1997)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"3004","DOI":"10.1137\/23M1563281","volume":"38","author":"DW Cranston","year":"2024","unstructured":"Cranston, D.W., Liu, C.-H.: Proper conflict-free coloring of graphs with large maximum degree. SIAM J. Discret. Math. 38(4), 3004\u20133027 (2024)","journal-title":"SIAM J. Discret. Math."},{"key":"35_CR9","unstructured":"Delcourt, M., Postle, L.: Reducing linear hadwiger\u2019s conjecture to coloring small graphs. CoRR, abs\/2108.01633 (2021)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, 5th edn. (2017)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"4","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/13090465X","volume":"28","author":"J Enright","year":"2014","unstructured":"Enright, J., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discret. Math. 28(4), 1675\u20131685 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2022.09.011","volume":"324","author":"I Fabrici","year":"2023","unstructured":"Fabrici, I., Lu\u017ear, B., Rindo\u0161ov\u00e1, S., Sot\u00e1k, R.: Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. Discret. Appl. Math. 324, 80\u201392 (2023)","journal-title":"Discret. Appl. Math."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gutin, G.: Note on perfect forests. J. Graph Theory 82(3), 233\u2013235 (2016)","DOI":"10.1002\/jgt.21897"},{"key":"35_CR14","first-page":"160","volume":"87","author":"R Hickingbotham","year":"2023","unstructured":"Hickingbotham, R.: Odd colourings, conflict-free colourings and strong colouring numbers. Australas. J. Comb. 87, 160\u2013164 (2023)","journal-title":"Australas. J. Comb."},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A tree representation for p$$ _{\\text{4 }}$$-sparse graphs. Discret. Appl. Math. 35(2), 115\u2013129 (1992)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"35_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2025.114730","volume":"349","author":"A Jim\u00e9nez","year":"2026","unstructured":"Jim\u00e9nez, A., et al.: Boundedness for proper conflict-free and odd colorings. Discret. Math. 349(2), 114730 (2026)","journal-title":"Discret. Math."},{"issue":"2\u20133","key":"35_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F Kramer","year":"2008","unstructured":"Kramer, F., Kramer, H.: A survey on the distance-colouring of graphs. Discret. Math. 308(2\u20133), 422\u2013426 (2008)","journal-title":"Discret. Math."},{"issue":"1","key":"35_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113668","volume":"347","author":"C-H Liu","year":"2024","unstructured":"Liu, C.-H.: Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth. Discret. Math. 347(1), 113668 (2024)","journal-title":"Discret. Math."},{"issue":"3","key":"35_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21285","volume":"66","author":"C-H Liu","year":"2025","unstructured":"Liu, C.-H., Reed, B.: Asymptotically optimal proper conflict-free coloring. Random Struct. Algorithms 66(3), e21285 (2025)","journal-title":"Random Struct. Algorithms"},{"issue":"7","key":"35_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"PJ Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Comput. Math. Appl. 25(7), 15\u201325 (1993)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"35_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"35_CR22","volume":"499","author":"Y Wang","year":"2025","unstructured":"Wang, Y., Wang, W., Liu, R.: Proper conflict-free 6-coloring of planar graphs without short cycles. Appl. Math. Comput. 499, 129405 (2025)","journal-title":"Appl. Math. Comput."},{"key":"35_CR23","unstructured":"West, D.B., et\u00a0al.: Introduction to Graph Theory, vol.\u00a02. Prentice hall Upper Saddle River (2001)"}],"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-032-27732-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:47Z","timestamp":1780780427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","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":"Clermont-Ferrand","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}