Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Benedikt Klocker, Herbert Fleischner, Günther Raidl
January 2016
PDF Cite
Type
Conference Paper
Günther Raidl
Günther Raidl

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