{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:28Z","timestamp":1780822168117,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030181253","type":"print"},{"value":"9783030181260","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18126-0_10","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"111-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Vertex-Critical ($$P_5$$, banner)-Free Graphs"],"prefix":"10.1007","author":[{"given":"Qingqiong","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-10631-6_61","volume-title":"Algorithms and Computation","author":"D Bruce","year":"2009","unstructured":"Bruce, D., Ho\u00e0ng, C.T., Sawada, J.: A certifying algorithm for 3-colorability of P$$_5$$-free graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 594\u2013604. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_61"},{"key":"10_CR3","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring and list three-coloring H-free graphs. arXiv:1703.05684 [math.CO]"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs with one forbidden induced subgraph. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1774\u20131783 (2016)","DOI":"10.1137\/1.9781611974331.ch123"},{"key":"10_CR5","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":"10_CR6","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":"10_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01238034","volume":"54","author":"GA Dirac","year":"1951","unstructured":"Dirac, G.A.: Note on the colouring of graphs. Mathematische Zeitschrift 54, 347\u2013353 (1951)","journal-title":"Mathematische Zeitschrift"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. 27, 85\u201392 (1952)","journal-title":"J. Lond. Math. Soc."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0012-365X(93)90539-6","volume":"121","author":"JL Fouquet","year":"1993","unstructured":"Fouquet, J.L.: A decomposition for a class of $$({P}_5,\\overline{P_5})$$-free graphs. Discrete Math. 121, 75\u201383 (1993)","journal-title":"Discrete Math."},{"key":"10_CR11","first-page":"165","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen I. Publ. Math. Inst. Hungar. Acad. Sci. 8, 165\u201392 (1963)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10_CR12","first-page":"373","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen II. Publ. Math. Inst. Hungar. Acad. Sci. 8, 373\u2013395 (1963)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10_CR13","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":"10_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.dam.2015.10.024","volume":"216","author":"P Hell","year":"2017","unstructured":"Hell, P., Huang, S.: Complexity of coloring graphs without paths and cycles. Discrete Appl. Math. 216, 211\u2013232 (2017)","journal-title":"Discrete Appl. Math."},{"key":"10_CR15","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":"10_CR16","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":"10_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.dam.2018.11.010","volume":"258","author":"Shenwei Huang","year":"2019","unstructured":"Huang, S., Li, T., Shi, Y.: Critical (P6, banner)-free graphs. Discrete Appl. Math. (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.11.010","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR18","unstructured":"Kaminski, M., Pstrucha, A.: Certifying coloring algorithms for graphs without long induced paths. arXiv:1703.02485 [math.CO] (2017)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","volume":"109","author":"AV Kostochka","year":"2014","unstructured":"Kostochka, A.V., Yancey, M.: Ore\u2019s conjecture on color-critical graphs is almost true. J. Combin. Theory Ser. B 109, 73\u2013101 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"key":"10_CR20","volume-title":"The Four Color Problem","author":"O Ore","year":"1967","unstructured":"Ore, O.: The Four Color Problem. Academic Press, Cambridge (1967)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: $$3$$-colorability $$\\in \\cal{P}$$ for $$P_6$$-free graphs. Discrete Appl. Math. 136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"10_CR22","volume-title":"Introduction to Graph Theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:45:02Z","timestamp":1709815502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}