AbstractWe 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
A key theorem in algorithmic graph-minor theory is a min-max relation between the treewidth of a gra...
AbstractThe rank-width is a graph parameter related in terms of fixed functions to clique-width but ...
AbstractThis article proves the conjecture of Thomas that, for every graph G, there is an integer k ...
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor...
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its ...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In p...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractThe “tree-width” of a graph is defined and it is proved that for any fixed planar graph H, e...
AbstractThe path-width of a graph is the minimum value ofk such that the graph can be obtained from ...
The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tra...
A key theorem in algorithmic graph-minor theory is a min-max relation between the treewidth of a gra...
AbstractThe rank-width is a graph parameter related in terms of fixed functions to clique-width but ...
AbstractThis article proves the conjecture of Thomas that, for every graph G, there is an integer k ...
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor...
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its ...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In p...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
AbstractThe “tree-width” of a graph is defined and it is proved that for any fixed planar graph H, e...
AbstractThe path-width of a graph is the minimum value ofk such that the graph can be obtained from ...
The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tra...
A key theorem in algorithmic graph-minor theory is a min-max relation between the treewidth of a gra...
AbstractThe rank-width is a graph parameter related in terms of fixed functions to clique-width but ...
AbstractThis article proves the conjecture of Thomas that, for every graph G, there is an integer k ...
DOI
Add to ORKG