On signed digraphs with all cycles negative (Q5903667)

A free cyclic digraph is a digraph in which every cycle contains at least one arc which is not in any other cycle of the digraph. The note gives a characterization of the class of free cyclic digraphs and new proofs of the two results concerning the class of strong and upper digraphs and the class of free acyclic digraphs, by using the c-minimal strongly connected digraphs.