Abstract: We prove that for any xed r 2, the tree-width of graphs not containing Kr as a
topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial)
function of their rank-width. We also present renements of our bounds for other
graph classes such as Kr-minor free graphs and graphs of bounded genus.