A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three

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, 380:125233, 2020. [doi]

@article{KlockerFR20,
  title = {A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three},
  author = {Benedikt Klocker and Herbert Fleischner and Günther R. Raidl},
  year = {2020},
  doi = {10.1016/j.amc.2020.125233},
  url = {https://doi.org/10.1016/j.amc.2020.125233},
  researchr = {https://researchr.org/publication/KlockerFR20},
  cites = {0},
  citedby = {0},
  journal = {Applied Mathematics and Computation},
  volume = {380},
  pages = {125233},
}