The following pages link to On low rank-width colorings (Q5918207):
Displaying 8 items.
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)