Pages that link to "Item:Q5915769"
From MaRDI portal
The following pages link to Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769):
Displaying 12 items.
- Immersion and clustered coloring (Q2099417) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces (Q6582315) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Colouring strong products (Q6612523) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
