Pages that link to "Item:Q709231"
From MaRDI portal
The following pages link to Rank-width and tree-width of \(H\)-minor-free graphs (Q709231):
Displaying 19 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- A formal proof of the minor-exclusion property for treewidth-two graphs (Q1791156) (← links)
- \(K_{a,k}\) minors in graphs of bounded tree-width (Q1850628) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- Number of Cliques in Graphs with a Forbidden Subdivision (Q3449861) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- (Q5743430) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
