{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T20:21:02Z","timestamp":1783455662233,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003130","name":"FWO","doi-asserted-by":"publisher","award":["1222524N"],"award-info":[{"award-number":["1222524N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"FWO","doi-asserted-by":"publisher","award":["G0AGX24N"],"award-info":[{"award-number":["G0AGX24N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009714","name":"Children's Cardiomyopathy Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009714","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["VS01224N"],"award-info":[{"award-number":["VS01224N"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.tcs.2026.116094","type":"journal-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T23:45:16Z","timestamp":1781048716000},"page":"116094","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Three-coloring triangle-free graphs without long forbidden paths"],"prefix":"10.1016","volume":"1082","author":[{"given":"Yidong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorik","family":"Jooken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baoyuan","family":"Shan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116094_bib0001","series-title":"Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heigts, N.Y., 1972)","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1016\/j.tcs.2026.116094_bib0002","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/jgt.22028","article-title":"A survey on the computational complexity of coloring graphs with forbidden subgraphs","volume":"84","author":"Golovach","year":"2017","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.tcs.2026.116094_bib0003","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0963548398003678","article-title":"Uniquely colourable graphs and the hardness of colouring graphs of large girth","volume":"7","author":"Emden-Weinert","year":"1998","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.tcs.2026.116094_bib0004","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116094_bib0005","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP-completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.116094_bib0006","series-title":"Proceedings of the International Symposium on Mathematical Foundations of Computer Science 2013","first-page":"551","article-title":"Improved complexity results on k-coloring Pt\u2212free graphs","volume":"vol. 7551","author":"Huang","year":"2013"},{"key":"10.1016\/j.tcs.2026.116094_bib0007","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","article-title":"Deciding k-colorability of P5\u2212free graphs in polynomial time","volume":"57","author":"Ho\u00e0ng","year":"2010","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.tcs.2026.116094_bib0008","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/18M1234837","article-title":"Four-coloring P6\u2212free graphs. I. Extending an excellent precoloring","volume":"53","author":"Chudnovsky","year":"2024","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.116094_bib0009","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/18M1234849","article-title":"Four-coloring P6\u2212free graphs. II. Finding an excellent precoloring","volume":"53","author":"Chudnovsky","year":"2024","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116094_bib0010","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/s00493-017-3553-8","article-title":"Three-coloring and list three-coloring of graphs without induced paths on seven vertices","volume":"38","author":"Bonomo","year":"2018","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2026.116094_bib0011","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jctb.2019.04.006","article-title":"Obstructions for three-coloring graphs without induced paths on six vertices","volume":"140","author":"Chudnovsky","year":"2020","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"10.1016\/j.tcs.2026.116094_bib0012","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/18M1210290","article-title":"Obstructions for three-coloring and list three-coloring H-free graphs","volume":"34","author":"Chudnovsky","year":"2020","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.116094_bib0013","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2020.10.032","article-title":"Better 3-coloring algorithms: excluding a triangle and a seven vertex path","volume":"850","author":"Bonomo-Braberman","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116094_bib0014","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1002\/jgt.22151","article-title":"Exhaustive generation of k-critical H-free graphs","volume":"87","author":"Goedgebeur","year":"2018","journal-title":"J. Graph Theory"},{"issue":"5","key":"10.1016\/j.tcs.2026.116094_bib0015","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.disc.2012.10.019","article-title":"Triangle-free 2P3-free graphs are 4-colorable","volume":"313","author":"Pyatkin","year":"2013","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.116094_bib0016","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0012-365X(01)00335-1","article-title":"Three-colourability and forbidden subgraphs. II: polynomial algorithms","volume":"251","author":"Randerath","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.116094_bib0017","doi-asserted-by":"crossref","unstructured":"R. Chen, D. Wu, X. Zhang, Structure, perfect divisibility and coloring of (P2\u2009\u222a\u2009P4, C3)-free graphs, (2025). arXiv: 2509.14135 [math.CO].","DOI":"10.1142\/S1793830925501654"},{"key":"10.1016\/j.tcs.2026.116094_bib0018","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.dam.2018.09.031","article-title":"Certifying coloring algorithms for graphs without long induced paths","volume":"261","author":"Kami\u0144ski","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.116094_bib0019","unstructured":"J. Jooken, Computer-assisted graph theory: a survey, (2025). arXiv: 2508.20825 [math.CO]."},{"key":"10.1016\/j.tcs.2026.116094_bib0020","series-title":"49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)","first-page":"55:1","article-title":"Minimal obstructions to c-coloring in hereditary graph classes","volume":"volume 306","author":"Goedgebeur","year":"2024"},{"key":"10.1016\/j.tcs.2026.116094_bib0021","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.dam.2025.01.011","article-title":"Critical (P5, dart)-free graphs","volume":"366","author":"Xia","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.116094_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115411","article-title":"Some results on critical (P5, H)-free graphs","volume":"1051","author":"Xia","year":"2025","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116094_bib0023","unstructured":"J. Goedgebeur, J. Jooken, Code and data for the paper \u201cThree-coloring triangle-free graphs without long forbidden paths\u201d, (2025). (https:\/\/github.com\/JorikJooken\/threeColoringC3PtFreeGraphs)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T20:09:00Z","timestamp":1783454940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":23,"alternative-id":["S0304397526003440"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116094","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Three-coloring triangle-free graphs without long forbidden paths","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116094","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116094"}}