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

Benedikt Klocker, Herbert Fleischner, Günther Raidl
January 2019
PDF bib

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. 2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.

Type
Technical Report
Günther Raidl
Günther Raidl

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