A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three (bibtex)
by , ,
Reference:
A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree ThreeBenedikt Klocker, Herbert Fleischner, Günther R. Raidl2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.
Bibtex Entry:
@TechReport{KlockerFleischnerRaidl19tr,
author       = {Benedikt Klocker and Herbert Fleischner and G\"{u}nther R. Raidl},
title        = {A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three},
institution  = {Algorithms and Complexity Group, TU Wien},
year         = {2019},
number       = {AC-TR-19-007},
url          = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-007.pdf},
}
Powered by bibtexbrowser