Proper connection and proper-walk connection of digraphs

Anna Fiedorowicz, Elżbieta Sidorowicz, Èric Sopena

An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices $(u,v)$, the digraph $D$ contains a directed path (a directed walk) from $u$ to…