  This paper studies the structure of graphs with given tree-width and
excluding a fixed complete bipartite subgraph, which generalises the bounded
degree setting. We give a new structural description of such graphs in terms of
so-called quasi-tree-partitions. We demonstrate the utility of this result
through applications to (fractional) clustered colouring. Further
generalisations of these structural and colouring results are presented.
