189 citations · 374 across the 14 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
On the genera of polyhedral embeddings of cubic graph
Gunnar Brinkmann, Thomas Tucker, Nico Van Cleemput
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient…
math.CO2020
A simple and elementary proof of Whitney's unique embedding theorem
Gunnar Brinkmann
In this note we give a short and elementary proof of a more general version of Whitney's theorem that 3-connected planar graphs have a unique embedding in the plane. A consequence…
math.CO2020★ 1 cited
A Practical Algorithm for the Computation of the Genus
G. Brinkmann
We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algor…