{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:47Z","timestamp":1740122387860,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071265"],"award-info":[{"award-number":["12071265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MA032"],"award-info":[{"award-number":["ZR2019MA032"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10878-023-01088-5","type":"journal-article","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T10:01:21Z","timestamp":1697364081000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the chromatic number of $$P_5$$-free graphs with no large intersecting cliques"],"prefix":"10.1007","volume":"46","author":[{"given":"Weilun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6323-2923","authenticated-orcid":false,"given":"Xia","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"issue":"4","key":"1088_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3 G, Tuza Z (1990) Dominating cliques in $$P_5$$-free graphs. Period Math Hung 21(4):303\u2013308","journal-title":"Period Math Hung"},{"key":"1088_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.endm.2016.10.032","volume":"55","author":"C Brause","year":"2016","unstructured":"Brause C, Doan T, Schiermeyer I (2016) On the chromatic number of $$(P_5, K_{2, t})$$-free graphs. Electron Notes Discrete Math 55:127\u2013130","journal-title":"Electron Notes Discrete Math"},{"key":"1088_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2018.09.030","volume":"253","author":"C Brause","year":"2019","unstructured":"Brause C, Randerath B, Schiermeyer I, Vumar E (2019) On the chromatic number of $$2K_2$$-free graphs. Discrete Appl Math 253:14\u201324","journal-title":"Discrete Appl Math"},{"issue":"1","key":"1088_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1002\/jgt.22367","volume":"90","author":"M Chudnovsky","year":"2019","unstructured":"Chudnovsky M, Sivaraman V (2019) Perfect divisibility and 2-divisibility. J Graph Theory 90(1):54\u201360","journal-title":"J Graph Theory"},{"key":"1088_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 (2006) The strong perfect graph theorem. Ann Math 164:51\u2013229","journal-title":"Ann Math"},{"issue":"4","key":"1088_CR6","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 (2020) Coloring graphs with no induced five-vertex path or gem. J Graph Theory 95(4):527\u2013542","journal-title":"J Graph Theory"},{"key":"1088_CR7","first-page":"34","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P (1959) Graph theory and probability. Class Pap Comb 11:34\u201338","journal-title":"Class Pap Comb"},{"key":"1088_CR8","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 (2013) The chromatic number of $$(P_5, K_4)$$-free graphs. Discrete Math 313:743\u2013754","journal-title":"Discrete Math"},{"key":"1088_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","volume":"146","author":"J Fouquet","year":"1995","unstructured":"Fouquet J, Giakoumakis V, Maire F, Thuillier H (1995) On graphs without $$P_5$$ and $$\\bar{P_5}$$. Discrete Math 146:33\u201344","journal-title":"Discrete Math"},{"issue":"2\u20133","key":"1088_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0012-365X(03)00197-3","volume":"272","author":"S Gravier","year":"2003","unstructured":"Gravier S, Ho\u00e0ng CT, Maffray F (2003) Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Math 272(2\u20133):285\u2013290","journal-title":"Discrete Math"},{"key":"1088_CR11","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s A (1987) Problems from the world surrounding perfect graphs. In: Proceedings of international conference on combinatorial analysis and applications, vol 19, pp 413\u2013441","DOI":"10.4064\/am-19-3-4-413-441"},{"issue":"2","key":"1088_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/jgt.22656","volume":"97","author":"S Huang","year":"2021","unstructured":"Huang S, Karthick T (2021) On graphs with no induced five-vertex path or paraglider. J Graph Theory 97(2):305\u2013323","journal-title":"J Graph Theory"},{"key":"1088_CR13","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 (2016) Vizing bound for the chromatic number on some graph classes. Graphs Comb 32:1447\u20131460","journal-title":"Graphs Comb"},{"issue":"11","key":"1088_CR14","doi-asserted-by":"publisher","first-page":"3079","DOI":"10.1016\/j.disc.2018.07.018","volume":"341","author":"T Karthick","year":"2018","unstructured":"Karthick T, Mishra S (2018) Chromatic bounds for some classes of $$2K_2$$-free graphs. Discrete Math 341(11):3079\u20133088","journal-title":"Discrete Math"},{"key":"1088_CR15","unstructured":"Randerath B (1998) The Vizing bound for the chromatic number based on forbidden pairs. Ph.D. thesis, RWTH Aachen, Shaker Verlag"},{"issue":"7","key":"1088_CR16","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1016\/j.disc.2015.11.020","volume":"339","author":"I Schiermeyer","year":"2016","unstructured":"Schiermeyer I (2016) Chromatic number of $$P_5$$-free graphs: Reed\u2019s conjecture. Discrete Math 339(7):1940\u20131943","journal-title":"Discrete Math"},{"issue":"4","key":"1088_CR17","doi-asserted-by":"publisher","first-page":"609","DOI":"10.7494\/OpMath.2017.37.4.609","volume":"37","author":"I Schiermeyer","year":"2017","unstructured":"Schiermeyer I (2017) On the chromatic number of $$(P_5, windmill)$$-free graphs. Opusc Math 37(4):609\u2013615","journal-title":"Opusc Math"},{"key":"1088_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-018-1999-0","volume":"35","author":"I Schiermeyer","year":"2019","unstructured":"Schiermeyer I, Randerath B (2019) Polynomial $$\\chi $$-binding functions and forbidden induced subgraphs: a survey. Graphs Comb 35:1\u201331","journal-title":"Graphs Comb"},{"key":"1088_CR19","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00493-023-00015-w","volume":"43","author":"A Scott","year":"2023","unstructured":"Scott A, Seymour P, Spirkl S (2023) Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path. Combinatorica 43:845\u2013852","journal-title":"Combinatorica"},{"key":"1088_CR20","first-page":"557","volume-title":"The theory and applications of graphs","author":"D Sumner","year":"1981","unstructured":"Sumner D (1981) Subtrees of a graph and chromatic number. In: Chartrand G (ed) The theory and applications of graphs. Wiley, New York, pp 557\u2013576"},{"issue":"3","key":"1088_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon S (1980) A bound on the chromatic number of graphs without certain induced subgraphs. J Comb Theory Ser B 29(3):345\u2013346","journal-title":"J Comb Theory Ser B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01088-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01088-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01088-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T08:15:16Z","timestamp":1698221716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01088-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1088"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01088-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"19 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}