Pages that link to "Item:Q293650"
From MaRDI portal
The following pages link to On the facial Thue choice number of plane graphs via entropy compression method (Q293650):
Displaying 5 items.
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
