Circular binary strings without zigzags.
Binary strings without zigzags.
Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.
Page 1