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

Benedikt Klocker, Herbert Fleischner, Günther Raidl
January 2019
PDF Cite
Type
Technical Report
Günther Raidl
Günther Raidl

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