Pages that link to "Item:Q1671650"
From MaRDI portal
The following pages link to Linear bound for majority colourings of digraphs (Q1671650):
Displaying 6 items.
- Majority colorings of sparse digraphs (Q2030755) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties (Q6057659) (← links)
- Majority choosability of countable graphs (Q6181996) (← links)
- Partitioning problems via random processes (Q6658754) (← links)
- On generalised majority edge-colourings of graphs (Q6671598) (← links)
