Chudnovsky, MariaHajebi, SepehrSpirkl, Sophie2024-10-282024-10-282025-02https://doi.org/10.1016/j.ejc.2024.104074https://hdl.handle.net/10012/21169© 2024 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).A clock is a graph consisting of an induced cycle C and a vertex not in C with at least two non-adjacent neighbours in C. We show that every clock-free graph of large treewidth contains a "basic obstruction" of large treewidth as an induced subgraph: a complete graph, a subdivision of a wall, or the line graph of a subdivision of a wall.enAttribution 4.0 Internationalhttp://creativecommons.org/licenses/by/4.0/Article