{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:25:57Z","timestamp":1743117957924,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_33","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"411-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Critical Graphs in $$P_5$$-Free Graphs"],"prefix":"10.1007","author":[{"given":"Kathie","family":"Cameron","sequence":"first","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"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"33_CR1","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2018)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00493-017-3553-8","volume":"38","author":"F Bonomo","year":"2018","unstructured":"Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., Zhong, M.: Three-coloring and list three-coloring of graphs without induced paths on seven vertices. Combinatorica 38, 779\u2013801 (2018)","journal-title":"Combinatorica"},{"key":"33_CR3","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":"33_CR4","doi-asserted-by":"crossref","unstructured":"Cai, Q., Huang, S., Li, T., Shi, Y.: Vertex-critical ($${P}_5$$, banner)-free graphs. In: Frontiers in Algorithmics-13th International Workshop. LNCS, vol. 11458, pp. 111\u2013120 (2019)","DOI":"10.1007\/978-3-030-18126-0_10"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/18M1210290","volume":"34","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring and list three-coloring $${H}$$-free graphs. SIAM J. Discrete Math. 34, 431\u2013469 (2020)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR6","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs without induced paths on six vertices. J. Combin. Theory, Ser. B 140, 45\u201383 (2020)"},{"key":"33_CR7","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":"33_CR8","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: $$K_4$$-free graphs with no odd holes. J. Combin. Theory Ser. B 100, 313\u2013331 (2010)"},{"key":"33_CR9","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":"33_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"33_CR11","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":"33_CR12","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. London Math. Soc. 27, 85\u201392 (1952)","journal-title":"J. London Math. Soc."},{"key":"33_CR13","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. London Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.disc.2012.12.019","volume":"313","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Lemoine, L., Maffray, F., Morel, G.: The chromatic number of $$\\{{P}_5,{K}_4\\}$$-free graphs. Discrete Math. 313, 743\u2013754 (2013)","journal-title":"Discrete Math."},{"key":"33_CR15","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":"33_CR16","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":"33_CR17","unstructured":"Goedgebeur, J.: Homepage of generator for $$k$$-critical $$\\cal{H}$$-free graphs. https:\/\/caagt.ugent.be\/criticalpfree\/"},{"key":"33_CR18","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":"33_CR19","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":"33_CR20","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":"33_CR21","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":"33_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.dam.2018.11.010","volume":"258","author":"S Huang","year":"2019","unstructured":"Huang, S., Li, T., Shi, Y.: Critical $$({P}_6, banner)$$-free graphs. Discrete Appl. Math. 258, 143\u2013151 (2019)","journal-title":"Discrete Appl. Math."},{"key":"33_CR23","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":"33_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.jctb.2014.05.002"},{"key":"33_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2003.07.004","volume":"88","author":"VV Lozin","year":"2003","unstructured":"Lozin, V.V., Rautenbach, D.: Some results on graphs without long induced paths. Inform. Process. Lett. 88, 167\u2013171 (2003)","journal-title":"Inform. Process. Lett."},{"key":"33_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":"33_CR27","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1080\/00029890.1971.11992886","volume":"78","author":"L Mirsky","year":"1971","unstructured":"Mirsky, L.: A dual of Dilworth\u2019s decomposition theorem. Am. Math. Monthly 78, 876\u2013877 (1971)","journal-title":"Am. Math. Monthly"},{"key":"33_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Inform. Process. Lett. 28, 53\u201354 (1988)","journal-title":"Inform. Process. Lett."},{"key":"33_CR29","unstructured":"Ore, O.: The Four Color Problem. Academic Press, Cambridge (1967)"},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. s2\u201330, 264\u2013286 (1930)","DOI":"10.1112\/plms\/s2-30.1.264"}],"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-3-030-58150-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:43:39Z","timestamp":1619207019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","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":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}