A note on watchman's walks in de Bruijn graphs

arXiv2007.12825MaRDI QIDQ6345805

Danny Dyer, Brittany Pittman, Jared Howell

Publication date: 24 July 2020

Abstract: The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order $k$ is described by a de Bruijn sequence of order $k-1$. This idea is extended to certain subdigraphs of de Bruijn graphs.

This page was built for publication: A note on watchman's walks in de Bruijn graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345805)