A novel approach to covers of multigraphs with semi-edges (Q6985857)

In the paper under review, the authors consider two non-standard models (the incidence and the dart) for the definition of graphs with coloring. These models are equivalent to the standard one when restricted to simple graphs without isolated vertices. On the other hand, the dart and the incidence models have always equivalent expressive power, at least for graphs without isolated vertices. After verifying these equivalences, the authors consider how to formulate the notion of cover on both the dart and the incidence model, as well as that of equitable and degree partition and show how it is possible to use these concepts in order to describe practical algorithms as well as to reinterpret/prove statements like Leighton's theorem.