8 citations · 15 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
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★ 8 cited
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
Locally Hamiltonian graphs and minimal size of maximal graphs on a surface
James Davies, Carsten Thomassen
We prove that every locally Hamiltonian graph with vertices and possibly with multiple edges has at least edges with equality if and only if it triangulates the sph…