activity
20082026
most citedRank-width and Tree-width of H-minor-free Graphs

30 citations · 157 across the 83 of their papers we have counts for

collaborators
Showing 2009 · math.COShow all

1 paper · 2 filters

math.CO2009★ 30 cited

Rank-width and Tree-width of H-minor-free Graphs

Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos

We prove that for any fixed r>=2, the tree-width of graphs not containing K_r as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the…