Title of article
Rank-width and tree-width of -minor-free graphs
Author/Authors
Fomin، نويسنده , , Fedor V. and Oum، نويسنده , , Sang-il and Thilikos، نويسنده , , Dimitrios M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
12
From page
1617
To page
1628
Abstract
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 their rank-width. We also present refinements of our bounds for other graph classes such as K r -minor free graphs and graphs of bounded genus.
Journal title
European Journal of Combinatorics
Serial Year
2010
Journal title
European Journal of Combinatorics
Record number
1550266
Link To Document