The following pages link to Immersion and clustered coloring (Q2099417):
Displaying 6 items.
- Coloring immersion-free graphs (Q326817) (← links)
- Clustered colouring in minor-closed classes (Q2300163) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Biclique immersions in graphs with independence number 2 (Q6612311) (← links)
- A note on clique immersion of strong product graphs (Q6635105) (← links)