{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:29Z","timestamp":1780822169700,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819502172","type":"print"},{"value":"9789819502189","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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-981-95-0218-9_11","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:15Z","timestamp":1754168955000},"page":"139-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vertex-Critical $$(P_5,W_4)$$-Free Graphs"],"prefix":"10.1007","author":[{"given":"Wen","family":"Xia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorik","family":"Jooken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iain","family":"Beaton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1020-2883","authenticated-orcid":false,"given":"Ben","family":"Cameron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"11_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-critical $$P_3+\\ell P_1$$-free and vertex-critical (gem, co-gem)-free graphs. Discrete Appl. Math. 344, 179\u2013187 (2024)","journal-title":"Discrete Appl. Math."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Adekanye, M., Bury, C., Cameron, B., Knodel, T.: On the Finiteness of $$k$$-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls. In Adele Anna Rescigno and Ugo Vaccaro editors, 35th International Workshop on Combinatorial Algorithms. IWOCA 2024 Ischia, Italy, July 1-3, 2024, Proceedings, volume 14764 of Lecture Notes in Computer Science, pages 301\u2013313, 2024","DOI":"10.1007\/978-3-031-63021-7_23"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(99)00012-8","volume":"94","author":"V Barr\u00e9","year":"1999","unstructured":"Barr\u00e9, V., Fouquet, J.L.: On minimal imperfect graphs without induced $$P_5$$. Discrete Appl. Math. 94, 9\u201333 (1999)","journal-title":"Discrete Appl. Math."},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2025.115234","volume":"1042","author":"I Beaton","year":"2025","unstructured":"Beaton, I., Cameron, B.: Vertex-critical graphs in co-gem-free graphs. Theoret. Comput. Sci. 1042, 115234 (2025)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bondy, J.A.., Murty, U.S.R..: Graph Theory. Springer, 2008","DOI":"10.1007\/978-1-84628-970-5"},{"key":"11_CR6","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":"11_CR7","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":"11_CR8","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":"11_CR9","doi-asserted-by":"crossref","unstructured":"Cai,Q., Huang, S., Li, T., Shi, Y.: Vertex-critical ($$P_5$$,banner)-free graph. In: Chen,Y., Deng, X., Mei Lu, (eds.) Frontiers in Algorithmics -13th International Workshop, FAW 2019, Sanya, China, April 29-May 3, 2019, Proceedings, volume 11458 of Lecture Notes in Computer Science, pp. 111\u2013120, 2019","DOI":"10.1007\/978-3-030-18126-0_10"},{"key":"11_CR10","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":"11_CR11","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":"11_CR12","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":"11_CR13","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. of Math. 164, 51\u2013229 (2006)","journal-title":"Ann. of Math."},{"key":"11_CR14","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":"11_CR15","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., 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":"11_CR16","unstructured":"Goedgebeur, J.: Homepage of generator for $$k$$-critical $$\\cal{H}$$-free graphs. https:\/\/caagt.ugent.be\/criticalpfree\/"},{"key":"11_CR17","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":"11_CR18","unstructured":"Goedgebeur,J., Jooken, J., Okrasa,K., Rz\u0105\u017cewski, P., Schaudt, O.: Minimal Obstructions to $$C_5$$-Coloring in Hereditary Graph Classes In: Kr\u00e1lovi\u010d, R., Ku\u010dera, A. (eds.) 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), vol. 306 of LIPIcs, pp. 55:1\u201355:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2024"},{"key":"11_CR19","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.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":"11_CR20","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., Recoskie, 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":"11_CR21","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":"11_CR22","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":"11_CR23","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":"11_CR24","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":"11_CR25","unstructured":"Jooken, J.: GitHub page containing generator for $$k$$-vertex-critical $$\\cal{H}$$-free graphs. https:\/\/github.com\/JorikJooken\/kVertexCriticalGraphs"},{"key":"11_CR26","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. Discrete Appl. Math. 261, 258\u2013267 (2019)","journal-title":"Discrete Appl. Math."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heigts, N.Y., 1972), pp. 85\u2013103, 1972","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"11_CR28","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":"11_CR29","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., Galil, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4, 35\u201344 (1983)","journal-title":"J. Algorithms"},{"key":"11_CR30","unstructured":"Lov\u00e1sz,L.: Coverings and coloring of hypergraphs. In: Proceedings of the Fourth South-Eastern Conference on Combinatorics, Graph theory, and Computing. Congress. Numer., VIII, pp. 3\u201312, 1973"},{"key":"11_CR31","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."},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"R McConnell","year":"2011","unstructured":"McConnell, R., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev 5(2), 119\u2013161 (2011)","journal-title":"Certifying algorithms. Comput. Sci. Rev"},{"key":"11_CR33","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. Symbolic Comput. 60, 94\u2013112 (2014)","journal-title":"II. J. Symbolic Comput."},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Xia, W., Jooken, J., Goedgebeur, J.,Beaton, I., Cameron, B., Huang, S.: Critical $$(P_5,W_4)$$-Free Graphs. arXiv:2501.04923 [math.CO], 2025","DOI":"10.1007\/978-981-95-0218-9_11"},{"key":"11_CR35","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":"11_CR36","doi-asserted-by":"crossref","unstructured":"Xia, W., Jooken, J., Goedgebeur, J., Huang, S.: Some Results on Critical $$(P_5,H)$$-free graphs. In: 30th International Conference on Computing and Combinatorics, COCOON 2024, pp. 433\u2013444, 2025","DOI":"10.1007\/978-981-96-1090-7_35"}],"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-95-0218-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:47:34Z","timestamp":1757335654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author(s) have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests."}},{"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":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","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":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}