2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.CO2020★ 1 cited
Exponentially many Z5-colorings in simple planar graphs
Rikke Langhede, Carsten Thomassen
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
math.CO2020
Group connectivity and group coloring: small groups versus large groups
Rikke Langhede, Carsten Thomassen
A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group…
math.CO2020★ 2 cited
Many flows in the group connectivity setting
Matt DeVos, Rikke Langhede, Bojan Mohar +1
Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}…