Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking

Tony Grubman, Y. Ahmet Sekercioglu, David R. Wood. Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. Discrete Applied Mathematics, 213:101-113, 2016. [doi]

@article{GrubmanSW16,
  title = {Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking},
  author = {Tony Grubman and Y. Ahmet Sekercioglu and David R. Wood},
  year = {2016},
  doi = {10.1016/j.dam.2016.05.013},
  url = {http://dx.doi.org/10.1016/j.dam.2016.05.013},
  researchr = {https://researchr.org/publication/GrubmanSW16},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {213},
  pages = {101-113},
}