{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:18:40Z","timestamp":1743056320320,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_27","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"319-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Colouring Graphs with No Induced Six-Vertex Path or Diamond"],"prefix":"10.1007","author":[{"given":"Jan","family":"Goedgebeur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiao","family":"Ju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Owen","family":"Merkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"27_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":"27_CR2","doi-asserted-by":"crossref","unstructured":"Brinkmann, G., Coolsaet, K., Goedgebeur, J., M\u00e9lot, H.: House of graphs: a database of interesting graphs. Discret. Appl. Math. 161(1\u20132), 311\u2013314 (2013). https:\/\/hog.grinvin.org\/","DOI":"10.1016\/j.dam.2012.07.018"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-18126-0_10","volume-title":"Frontiers in Algorithmics","author":"Q Cai","year":"2019","unstructured":"Cai, Q., Huang, S., Li, T., Shi, Y.: Vertex-critical ($$P_5$$, banner)-free graphs. In: Chen, Y., Deng, X., Lu, M. (eds.) FAW 2019. LNCS, vol. 11458, pp. 111\u2013120. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18126-0_10"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1017\/S0004972719000352","volume":"100","author":"K Cameron","year":"2019","unstructured":"Cameron, K., Huang, S., Merkel, O.: A bound for the chromatic number of ($$P_5$$, gem)-free graphs. Bull. Aust. Math. Soc. 100(2), 182\u2013188 (2019)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/jgt.22668","volume":"97","author":"K Cameron","year":"2021","unstructured":"Cameron, K., Huang, S., Merkel, O.: An optimal $$\\chi $$-bound for ($$P_6$$, diamond)-free graphs. J. Graph Theory 97(3), 451\u2013465 (2021)","journal-title":"J. Graph Theory"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jctb.2019.04.006","volume":"140","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory Ser. B 140, 45\u201383 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1002\/jgt.22572","volume":"95","author":"M Chudnovsky","year":"2020","unstructured":"Chudnovsky, M., Karthick, T., Maceli, P., Maffray, F.: Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95(4), 527\u2013542 (2020)","journal-title":"J. Graph Theory"},{"key":"27_CR8","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":"27_CR9","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Spirkl, S., Zhong, M.: Four-coloring $$P_6$$-free graphs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 1239\u20131256 (2019)","DOI":"10.1137\/1.9781611975482.76"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.jcss.2017.06.005","volume":"89","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. J. Comput. Syst. Sci. 89, 410\u2013431 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Gaspers, S., Huang, S.: Linearly $$\\chi $$-bounding $$(P_6, C_4)$$-free graphs. In: Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), pp. 263\u2013274 (2017)","DOI":"10.1007\/978-3-319-68705-6_20"},{"key":"27_CR12","unstructured":"Goedgebeur, J.: Homepage of a generator for $$k$$-critical $$H$$-free graphs. https:\/\/caagt.ugent.be\/criticalpfree\/"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Goedgebeur, J., Huang, S., Ju, Y., Merkel, O.: Colouring graphs with no induced six-vertex path or diamond. arXiv preprint arXiv:2106.08602 (2021)","DOI":"10.1007\/978-3-030-89543-3_27"},{"key":"27_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"},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"3\u20134","key":"27_CR16","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Appl. Math. 19(3\u20134), 413\u2013441 (1987)","journal-title":"Appl. Math."},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1002\/jgt.22251","volume":"89","author":"T Karthick","year":"2018","unstructured":"Karthick, T., Maffray, F.: Coloring (gem, co-gem)-free graphs. J. Graph Theory 89(3), 288\u2013303 (2018)","journal-title":"J. Graph Theory"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/18M1190653","volume":"33","author":"T Karthick","year":"2019","unstructured":"Karthick, T., Maffray, F.: Square-free graphs with no six-vertex induced path. SIAM J. Discret. Math. 33(2), 874\u2013909 (2019)","journal-title":"SIAM J. Discret. Math."},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s00373-015-1651-1","volume":"32","author":"T Karthick","year":"2016","unstructured":"Karthick, T., Maffray, F.: Vizing bound for the chromatic number on some graph classes. Graphs Comb. 32, 1447\u20131460 (2016)","journal-title":"Graphs Comb."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00373-018-1905-9","volume":"34","author":"T Karthick","year":"2018","unstructured":"Karthick, T., Mishra, S.: On the chromatic number of ($${P_6}$$, diamond)-free graphs. Graphs Comb. 34, 677\u2013692 (2018)","journal-title":"Graphs Comb."},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(01)00335-1","volume":"251","author":"B Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I., Tewes, M.: Three-colourability and forbidden subgraphs II: polynomial algorithms. Discret. Math. 251, 137\u2013153 (2002)","journal-title":"Discret. Math."}],"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-89543-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:36:33Z","timestamp":1673577393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"3.1","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":"2.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}