{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:01:58Z","timestamp":1762300918707,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_35","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:58Z","timestamp":1741105978000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some Results on\u00a0Critical ($$P_5,H$$)-Free Graphs"],"prefix":"10.1007","author":[{"given":"Wen","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorik","family":"Jooken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.dam.2023.11.042","volume":"344","author":"T Abuadas","year":"2024","unstructured":"Abuadas, T., Cameron, B., Ho\u00e0ng, C.T., Sawada, J.: Vertex-critucal $$P_3+lP_1$$-free and vertex-critical (gem, co-gem)-free graphs. Discrete Appl. Math. 344, 179\u2013187 (2024)","journal-title":"Discrete Appl. Math."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.: Graph Theory. Springer, S. R. (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.dam.2022.05.014","volume":"320","author":"C Brause","year":"2022","unstructured":"Brause, C., Gei\u00dfer, M., Schiermeyer, I.: Homogeneous sets, clique-separators, critical graphs and optimal $$\\chi $$-binding functions. Discrete Appl. Math. 320, 211\u2013222 (2022)","journal-title":"Discrete Appl. Math."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bruce, D., Ho\u00e0ng, C.T., Sawada, J.: A certifying algorithm for 3-colorability of $$P_5$$-free graphs. In: Proceedings of 20th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science 5878, pp. 594\u2013604 (2009)","DOI":"10.1007\/978-3-642-10631-6_61"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.dam.2023.03.008","volume":"334","author":"Q Cai","year":"2023","unstructured":"Cai, Q., Goedgebeur, J., Huang, S.: Some results on $$k$$-critical $$P_5$$-free graphs. Discrete Appl. Math. 334, 91\u2013100 (2023)","journal-title":"Discrete Appl. Math."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s00373-024-02756-x","volume":"40","author":"B Cameron","year":"2024","unstructured":"Cameron, B., Ho\u00e0ng, C.T.: Infinite families of $$k$$-vertex-critical $$({P}_5,{C}_5)$$-graphs. Graphs Combin 40, 30 (2024)","journal-title":"Graphs Combin"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2021.11.001","volume":"312","author":"B Cameron","year":"2022","unstructured":"Cameron, B., Ho\u00e0ng, C.T., Sawada, J.: Dichotomizing $$k$$-vertex-critical $$H$$-free graphs for $$H$$ of order four. Discrete Appl. Math. 312, 106\u2013115 (2022)","journal-title":"Discrete Appl. Math."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2021.02.029","volume":"864","author":"K Cameron","year":"2021","unstructured":"Cameron, K., Goedgebeur, J., Huang, S., Shi, Y.: $$k$$-critical graphs in $$P_5$$-free graphs. Theoret. Comput. Sci. 864, 80\u201391 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"35_CR10","unstructured":"Chudnovsky, M., Spirkl, S., Zhong, M.: Four-coloring $$P_6$$-free graphs. In: Proceedings of the Tirtieth Anunuals ACM-SIAM Symposiumnon Disctete Algorithms, SODA\u201919, pp. 1239\u20131256, USA (2019)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Coolsaet, K., D\u2019hondt, S., Goedgebeur, J.: House of Graphs 2.0: a database of interesting graphs and more. Discrete Appl. Math. 325, 97\u2013107 (2023). Available at https:\/\/houseofgraphs.org","DOI":"10.1016\/j.dam.2022.10.013"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.dam.2016.05.018","volume":"216","author":"HS Dhaliwal","year":"2017","unstructured":"Dhaliwal, H.S., Hamel, A.M., Ho\u00e0ng, C.T., Maffray, F., McConnell, T.J.D., Panait, S.A.: On color-critical ($${P}_5$$, co-$${P_5}$$)-free graphs. Discrete Appl. Math. 216, 142\u2013148 (2017)","journal-title":"Discrete Appl. Math."},{"key":"35_CR13","unstructured":"Goedgebeur, J.: Homepage of generator for $$k$$-critical $$\\cal{H}$$-free graphs: https:\/\/caagt.ugent.be\/criticalpfree\/"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/jgt.22151","volume":"87","author":"J Goedgebeur","year":"2018","unstructured":"Goedgebeur, J., Schaudt, O.: Exhaustive generation of $$k$$-critical $$\\cal{H} $$-free graphs. J. Graph Theory 87, 188\u2013207 (2018)","journal-title":"J. Graph Theory"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Berge, C., Chv\u00e1tal, V., (eds.) Topics on Perfect Graphs, vol. 88 of North-Holland Mathematics Studies, pp. 325\u2013356. North-Holland (1984)","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"CT Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V., Sawada, J., Shu, X.: Deciding $$k$$-colorability of $$P_5$$-free graphs in polynomial time. Algorithmica 57, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.dam.2014.06.007","volume":"182","author":"CT Ho\u00e0ng","year":"2015","unstructured":"Ho\u00e0ng, C.T., Moore, B., Recoskiez, D., Sawada, J., Vatshelle, M.: Constructions of $$k$$-critical $${P_5}$$-free graphs. Discrete Appl. Math. 182, 91\u201398 (2015)","journal-title":"Discrete Appl. Math."},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.ejc.2015.06.005","volume":"51","author":"S Huang","year":"2016","unstructured":"Huang, S.: Improved complexity results on $$k$$-coloring $$P_t$$-free graphs. European J. Combin. 51, 336\u2013346 (2016)","journal-title":"European J. Combin."},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2023.02.019","volume":"334","author":"S Huang","year":"2023","unstructured":"Huang, S., Li, J., Xia, W.: Critical ($$P_5, bull$$)-free graphs. Discrete Appl. Math. 334, 15\u201325 (2023)","journal-title":"Discrete Appl. Math."},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.dam.2023.07.014","volume":"341","author":"S Huang","year":"2023","unstructured":"Huang, S., Li, Z.: Vertex-critical ($$P_5, chair$$)-free graphs. Discrete Appl. Math. 341, 9\u201315 (2023)","journal-title":"Discrete Appl. Math."},{"key":"35_CR22","unstructured":"Jooken, J.: GitHub page containing generator for $$k$$-vertex-critical $$\\cal{H}$$-free graphs: https:\/\/github.com\/JorikJooken\/kVertexCriticalGraphs"},{"key":"35_CR23","first-page":"61","volume":"2","author":"M Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lazin, V.: Coloring edges and vertices of graphs without short or long cycles. Contrib. Discrete Math. 2, 61\u201366 (2007)","journal-title":"Contrib. Discrete Math."},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.dam.2018.09.031","volume":"261","author":"M Kami\u0144ski","year":"2019","unstructured":"Kami\u0144ski, M., Pstrucha, A.: Certifying coloring algorithms for graphs without long induced paths. Discret. Appl. Math. 261, 258\u2013267 (2019)","journal-title":"Discret. Appl. Math."},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven, D., Gail, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4, 35\u201344 (1983)","journal-title":"J. Algorithms"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1137\/110829222","volume":"26","author":"F Maffray","year":"2012","unstructured":"Maffray, F., Morel, G.: On 3-colorable $$P_5$$-free graphs. SIAM J. Discrete Math. 26, 1682\u20131708 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","volume":"162","author":"F Maffray","year":"1996","unstructured":"Maffray, F., Preissmann, M.: On the NP-completeness of the $$k$$-colorability problem for triangle-free graphs. Discrete Math. 162, 313\u2013317 (1996)","journal-title":"Discrete Math."},{"key":"35_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism. II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"II. J. Symb. Comput."},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Xia, W., Jooken, J., Goedgebeur, J., Huang, S.: Critical $$(P_5,dart)$$-free graphs. In: 16th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2023, pp. 390\u2013402 (2024)","DOI":"10.1007\/978-3-031-49614-1_29"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Xia, W., Jooken, J., Goedgebeur, J., Huang, S.: Some Results on Critical $$(P_5,H)$$-free graphs. arXiv:2403.05611 [math.CO] (2024)","DOI":"10.1016\/j.tcs.2025.115411"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T09:07:17Z","timestamp":1757149637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}