A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

Abstract

Full Citation:

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three. Applied Mathematics and Computation, volume 380, number 125233, 2020.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.