  In this note we revisit the dart graph and the squared dart digraph
constructions and prove that they yield strongly connected digraphs when
applied to connected graphs of minimum valence at least 3.
