{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:11:55Z","timestamp":1766178715240,"version":"3.44.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:00:00Z","timestamp":1752105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:00:00Z","timestamp":1752105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CE48-0013","ANR-17-EURE-0004"],"award-info":[{"award-number":["ANR-19-CE48-0013","ANR-17-EURE-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJAP2302"],"award-info":[{"award-number":["JPMJAP2302"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02942-5","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:50:25Z","timestamp":1752148225000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dichromatic number of chordal graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0414-8136","authenticated-orcid":false,"given":"Lucas","family":"Picasarri-Arrieta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,10]]},"reference":[{"key":"2942_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113193","volume":"346","author":"P Aboulker","year":"2022","unstructured":"Aboulker, P., Aubian, G.: Four proofs of the Directed Brooks\u2019 Theorem. Discret. Math. 346, 113193 (2022)","journal-title":"Discret. Math."},{"issue":"4","key":"2942_CR2","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1137\/22M1481427","volume":"36","author":"P Aboulker","year":"2022","unstructured":"Aboulker, P., Aubian, G., Steiner, R.: Heroes in orientations of chordal graphs. SIAM J. Discret. Math. 36(4), 2497\u20132505 (2022)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2942_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/jgt.21811","volume":"79","author":"SD Andres","year":"2015","unstructured":"Andres, S.D., Hochst\u00e4ttler, W.: Perfect digraphs. J. Graph Theory 79(1), 21\u201329 (2015)","journal-title":"J. Graph Theory"},{"key":"2942_CR4","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Bellitto, T., Schweser, T., Stiebitz, M.: Haj\u00f3s and ore constructions for digraphs. Electron. J. Comb, 27(1), (2020)","DOI":"10.37236\/8942"},{"key":"2942_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory Algorithms and Applications, 2nd edn. Springer-Verlag, London (2009)","edition":"2"},{"issue":"6","key":"2942_CR6","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2942_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37(2), 194\u2013197 (1941)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"2942_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. Annals Math. 164, 51\u2013229 (2006)","journal-title":"Annals Math."},{"key":"2942_CR9","unstructured":"Erd\u0151s, P.: Problems and results in number theory and graph theory. In Proc. Ninth Manitoba Conference on Numerical Mathamatics and Computing, pages 3\u201321, (1979)"},{"issue":"6","key":"2942_CR10","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/jgt.3190150604","volume":"15","author":"P Erd\u0151s","year":"1991","unstructured":"Erd\u0151s, P., Gimbel, J., Kratsch, D.: Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15(6), 579\u2013585 (1991)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2942_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/100803870","volume":"25","author":"A Harutyunyan","year":"2011","unstructured":"Harutyunyan, A., Mohar, B.: Gallai\u2019s theorem for list coloring of digraphs. SIAM J. Discret. Math. 25(1), 170\u2013180 (2011)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"2942_CR12","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00493-014-2862-4","volume":"35","author":"R Hoshino","year":"2015","unstructured":"Hoshino, R., Kawarabayashi, K.: The edge density of critical digraphs. Combinatorica 35(5), 619\u2013631 (2015)","journal-title":"Combinatorica"},{"key":"2942_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2012.06.019","volume":"463","author":"D Meister","year":"2012","unstructured":"Meister, D., Telle, J.A.: Chordal digraphs. Theoret. Comput. Sci. 463, 73\u201383 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"2942_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Comb. Theory, Ser. B 33, 265\u2013270 (1982)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02942-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02942-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02942-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T04:27:25Z","timestamp":1757219245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02942-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,10]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2942"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02942-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,7,10]]},"assertion":[{"value":"2 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"81"}}