Minors and topological minors are two closely related graph containment relations that have attracted extensive attentions. Though giant breakthroughs on graph minors have been made over decades, several questions about these two relations remain open, especially for topological minors. This talk addresses part of our recent work in this direction, including a proof of Robertson's conjecture on well-quasi-ordering graphs by the topological minor relation, a complete characterization of the graphs having the Erdos-Posa property with respect to topological minors which answers a question of Robertson and Seymour, and a proof of Thomas' conjecture on half-integral packing. More open questions, such as Hadwiger's conjecture on graph coloring and its variations and relaxations, will be discussed in this talk.