A software used in the paper
K. Kangas, P. Kaski, M. Koivisto, J. H. Korhonen. On the number of connected sets in bounded degree graphs. In the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2014
for enumerating neighborhood graphs of radius 2 and given maximum degree and counting the number of boundary-connected sets.