Bend Complexity and Hamiltonian Cycles in Grid Graphs

Rahnuma Islam Nishat, Sue Whitesides. Bend Complexity and Hamiltonian Cycles in Grid Graphs. In Yixin Cao 0001, Jianer Chen, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Volume 10392 of Lecture Notes in Computer Science, pages 445-456, Springer, 2017. [doi]

@inproceedings{NishatW17,
  title = {Bend Complexity and Hamiltonian Cycles in Grid Graphs},
  author = {Rahnuma Islam Nishat and Sue Whitesides},
  year = {2017},
  doi = {10.1007/978-3-319-62389-4_37},
  url = {https://doi.org/10.1007/978-3-319-62389-4_37},
  researchr = {https://researchr.org/publication/NishatW17},
  cites = {0},
  citedby = {0},
  pages = {445-456},
  booktitle = {Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings},
  editor = {Yixin Cao 0001 and Jianer Chen},
  volume = {10392},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-62389-4},
}