Pages that link to "Item:Q5205808"
From MaRDI portal
The following pages link to Tight Lower Bounds for the Complexity of Multicoloring (Q5205808):
Displaying 9 items.
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- Lower bounds on strip discrepancy for nonatomic colorings (Q1587355) (← links)
- Optimal bounds for the colored Tverberg problem (Q2344495) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- (Q4375790) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710819) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)