1 paper
Tomaz Pisanski, Wilfried Imrich
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be…