The following pages link to Single‐conflict colouring (Q6055933):
Displaying 7 items.
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
- Constructing graphs with no independent transversals (Q6574378) (← links)
- Minimal abundant packings and choosability with separation (Q6651912) (← links)