Rank-width and tree-width of H-minor-free graphs

  title={Rank-width and tree-width of H-minor-free graphs},
  author={Fedor V. Fomin and Sang-il Oum and Dimitrios M. Thilikos},
  journal={Eur. J. Comb.},
We prove that for any fixed 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 refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus. 
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 27 references

Extremal set systems with restricted k-wise intersections

J. Comb. Theory, Ser. A • 2004
View 4 Excerpts
Highly Influenced

Upper bounds to the clique width of graphs

Discrete Applied Mathematics • 2000
View 4 Excerpts
Highly Influenced

On the Maximum Number of Cliques in a Graph

Graphs and Combinatorics • 2007
View 6 Excerpts
Highly Influenced

An improved linear edge bound for graph linkages

Eur. J. Comb. • 2005
View 2 Excerpts
Highly Influenced

An extremal function for contractions of graphs

A. Thomason
Math. Proc. Cambridge Philos. Soc., 95(2):261–265, • 1984
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…