Pages that link to "Item:Q2300163"
From MaRDI portal
The following pages link to Clustered colouring in minor-closed classes (Q2300163):
Displaying 14 items.
- Defective and clustered graph colouring (Q1751289) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
- Colouring strong products (Q6612523) (← links)
- The excluded tree minor theorem revisited (Q6632794) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)