The following pages link to (Q2921752):
Displayed 10 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Rainbow graph splitting (Q719272) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)