Pages that link to "Item:Q2277485"
From MaRDI portal
The following pages link to Every 8-uniform 8-regular hypergraph is 2-colorable (Q2277485):
Displaying 5 items.
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- Coloring and the Lovász local lemma (Q847296) (← links)
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- Cubic graphs with total domatic number at least two (Q1692630) (← links)
