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

by Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Reference:

A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree ThreeBenedikt Klocker, Herbert Fleischner, Günther R. RaidlApplied Mathematics and Computation, volume 380, number 125233, 2020.

Bibtex Entry:

@article{klocker-20a, author = {Benedikt Klocker and Herbert Fleischner and Günther R. Raidl}, title = {A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three}, journal = {Applied Mathematics and Computation}, volume = 380, number = {125233}, year = 2020, doi = {10.1016/j.amc.2020.125233}, url = {https://www.sciencedirect.com/science/article/abs/pii/S0096300320302022} }

Powered by bibtexbrowser