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

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

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

Reference:

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing NumbersBenedikt Klocker, Herbert Fleischner, Günther R. RaidlHybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer.

Bibtex Entry:

@inproceedings{klocker-16,
  author={Benedikt Klocker and Herbert Fleischner and G{\"u}nther R. Raidl},
  editor={Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi},
  title={Finding Uniquely Hamiltonian Graphs of Minimum Degree
	Three with Small Crossing Numbers},
  booktitle={Hybrid Metaheuristics: 10th International Workshop, HM 2016},
  address = {Plymouth, UK},
  year={2016},
  publisher={Springer},
  pages={1--16},
  series={LNCS},
  volume={9668},
  url={https://www.ac.tuwien.ac.at/files/pub/klocker-16.pdf},
}