8 citations · 15 across the 7 of their papers we have counts for
10 papers
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pac…
4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
Carsten Thomassen, Carol T. Zamfirescu
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles. We do not know if there exists such a family…
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.
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…
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…
Planar Ramsey graphs
Maria Axenovich, Carsten Thomassen, Ursula Schade +1
We say that a graph is planar unavoidable if there is a planar graph such that any red/blue coloring of the edges of contains a monochromatic copy of , otherwise we…