17 citations · 56 across the 23 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018★ 1 cited
The Connectivity of the Dual
Drago Bokal, Gunnar Brinkmannb, Carol T. Zamfirescu
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficientl…
math.CO2018★ 14 cited
Graphs with few Hamiltonian Cycles
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number of hamiltonian cycles, which is especially efficient for small . Ou…