Pages that link to "Item:Q1356486"
From MaRDI portal
The following pages link to Hypergraph colouring and the Lovász local lemma (Q1356486):
Displaying 13 items.
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- On the dynamic coloring of graphs (Q617650) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- Dynamic chromatic number of regular graphs (Q713302) (← links)
- Coloring and the Lovász local lemma (Q847296) (← links)
- On \(r\)-dynamic chromatic number of graphs (Q908316) (← links)
- Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- ON <i>k</i>-LOCAL AND <i>k</i>-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS (Q4277966) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
