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 22 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)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- Blocking set free configurations and their relations to digraphs and hypergraphs (Q1356757) (← 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)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- Polychromatic colorings and cover decompositions of hypergraphs (Q2007510) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs (Q2213812) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- Partitioning claw-free subcubic graphs into two dominating sets (Q2657047) (← links)
- On 2-Colorings of Hypergraphs (Q2947946) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- The prime submodules hypergraph of a free module of finite rank over a commutative ring (Q6090972) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
