20 citations · 67 across the 25 of their papers we have counts for
1 paper · 1 filter
Wilfried Imrich, Iztok Peterin
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesi…