{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:17:58Z","timestamp":1783153078494,"version":"3.54.6"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0014"],"award-info":[{"award-number":["ANR-21-CE48-0014"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ipl.2026.106646","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:13:57Z","timestamp":1779380037000},"page":"106646","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Coloring hardness on low twin-width graphs"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1653-5822","authenticated-orcid":false,"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ipl.2026.106646_bib0001","doi-asserted-by":"crossref","first-page":"3:1","DOI":"10.1145\/3486655","article-title":"Twin-width I: tractable FO model checking","volume":"69","author":"Bonnet","year":"2022","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.ipl.2026.106646_bib0002","article-title":"Twin-width II: small classes","volume":"2","author":"Bonnet","year":"2022","journal-title":"Comb. Theory"},{"issue":"5","key":"10.1016\/j.ipl.2026.106646_bib0003","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/21M142188X","article-title":"Twin-width III: max independent set, min dominating set, and coloring","volume":"53","author":"Bonnet","year":"2024","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2026.106646_bib0004","series-title":"40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7\u20139, 2023","first-page":"10:1","article-title":"Approximating highly inapproximable problems on graphs of bounded twin-width","volume":"254","author":"Berg\u00e9","year":"2023"},{"key":"10.1016\/j.ipl.2026.106646_bib0005","series-title":"41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, March 12\u201314, 2024","first-page":"8:1","article-title":"Faster graph algorithms through DAG compression","volume":"289","author":"Bannach","year":"2024"},{"key":"10.1016\/j.ipl.2026.106646_bib0006","series-title":"Proc. ICALP 2022","first-page":"18:1","article-title":"Deciding twin-width at most 4 is NP-Complete","volume":"229","author":"Berg\u00e9","year":"2022"},{"issue":"2","key":"10.1016\/j.ipl.2026.106646_bib0007","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ipl.2026.106646_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103749","article-title":"Planar graph with twin-width seven","volume":"123","author":"Kr\u00e1l\u2019","year":"2025","journal-title":"Eur. J. Comb."},{"issue":"4","key":"10.1016\/j.ipl.2026.106646_bib0009","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1137\/23M1623823","article-title":"Twin-width of planar graphs is at most 8, and some related bounds","volume":"39","author":"Hlinen\u00fd","year":"2025","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.ipl.2026.106646_bib0010","series-title":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1036","article-title":"Twin-width VI: the lens of contraction sequences","author":"Bonnet","year":"2022"},{"key":"10.1016\/j.ipl.2026.106646_bib0011","series-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4\u20137, 2025, Jena, Germany","first-page":"6:1","article-title":"Twin-width one","volume":"327","author":"Ahn","year":"2025"},{"key":"10.1016\/j.ipl.2026.106646_bib0012","series-title":"16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8\u201310, 2021, Lisbon, Portugal","first-page":"10:1","article-title":"Twin-width and polynomial kernels","volume":"214","author":"Bonnet","year":"2021"},{"issue":"3","key":"10.1016\/j.ipl.2026.106646_bib0013","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","article-title":"Permutation graphs and transitive graphs","volume":"19","author":"Even","year":"1972","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.ipl.2026.106646_bib0014","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique-Width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10.1016\/j.ipl.2026.106646_bib0015","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00571188","article-title":"Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm","volume":"8","author":"Damaschke","year":"1991","journal-title":"Order"},{"issue":"4","key":"10.1016\/j.ipl.2026.106646_bib0016","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.ipl.2026.106646_bib0017","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539791200375","article-title":"Polynomial algorithms for Hamiltonian cycle in cocomparability graphs","volume":"23","author":"Deogun","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2026.106646_bib0018","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2015.11.024","article-title":"The Firefighter problem on graph classes","volume":"613","author":"Fomin","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10.1016\/j.ipl.2026.106646_bib0019","doi-asserted-by":"crossref","first-page":"1791","DOI":"10.1016\/j.dam.2012.03.021","article-title":"Restricted vertex multicut on permutation graphs","volume":"160","author":"Papadopoulos","year":"2012","journal-title":"Discret. Appl. Math."},{"issue":"16","key":"10.1016\/j.ipl.2026.106646_bib0020","doi-asserted-by":"crossref","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","article-title":"The firefighter problem for graphs of maximum degree three","volume":"307","author":"Finbow","year":"2007","journal-title":"Discret. Math."},{"issue":"2","key":"10.1016\/j.ipl.2026.106646_bib0021","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0196-6774(03)00073-7","article-title":"Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width","volume":"48","author":"Cualinescu","year":"2003","journal-title":"J. Algor."},{"key":"10.1016\/j.ipl.2026.106646_bib0022","series-title":"Twin-Width and Contraction Sequences","author":"Bonnet","year":"2024"},{"issue":"3","key":"10.1016\/j.ipl.2026.106646_bib0023","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","article-title":"Achromatic number is NP-Complete for cographs and interval graphs","volume":"31","author":"Bodlaender","year":"1989","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/j.ipl.2026.106646_bib0024","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.ipl.2026.106646_bib0025","series-title":"Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, T\u00fcBingen, Germany, June 22\u201324, 2022, Revised Selected Papers","first-page":"230","article-title":"Extending partial representations of circular-Arc graphs","volume":"13453","author":"Fiala","year":"2022"},{"key":"10.1016\/j.ipl.2026.106646_bib0026","series-title":"34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, December 3\u20136, 2023","first-page":"11:1","article-title":"Sparse graphs of twin-width 2 have bounded tree-Width","volume":"283","author":"Bergougnoux","year":"2023"},{"key":"10.1016\/j.ipl.2026.106646_bib0027","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.jctb.2023.01.002","article-title":"Grid induced minor theorem for graphs of small degree","volume":"160","author":"Korhonen","year":"2023","journal-title":"J. Comb. Theory B"},{"issue":"2","key":"10.1016\/j.ipl.2026.106646_bib0028","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/23M1621514","article-title":"Twin-width of subdivisions of multigraphs","volume":"39","author":"Ahn","year":"2025","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.ipl.2026.106646_bib0029","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jctb.2023.10.008","article-title":"Induced subgraphs and tree decompositions VII. basic obstructions in H-free graphs","volume":"164","author":"Abrishami","year":"2024","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.ipl.2026.106646_bib0030","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.jctb.2025.03.002","article-title":"Sparse induced subgraphs of large treewidth","volume":"173","author":"Bonnet","year":"2025","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.ipl.2026.106646_bib0031","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.jctb.2024.03.005","article-title":"Treewidth versus clique number. III. tree-independence number of graphs with a forbidden structure","volume":"167","author":"Dallard","year":"2024","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.ipl.2026.106646_bib0032","series-title":"Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes","author":"Gartland","year":"2023"},{"key":"10.1016\/j.ipl.2026.106646_bib0033","series-title":"Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1016\/j.ipl.2026.106646_bib0034","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity?","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.ipl.2026.106646_bib0035","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/3051094","article-title":"Tight lower bounds on graph embedding problems","volume":"64","author":"Cygan","year":"2017","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001902600027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001902600027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:36:51Z","timestamp":1783150611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001902600027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":35,"alternative-id":["S002001902600027X"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106646","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Coloring hardness on low twin-width graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106646","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":"106646"}}