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 6 items.
- Immersion and clustered coloring (Q2099417) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← 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)
