Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs Without 4-Cycles
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00860-3
Abstract: The adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that the edge coloring set on any pair of adjacent vertices is distinct. The minimum number of… read more here.
Keywords: vertex distinguishing; adjacent vertex; edge; edge coloring ... See more keywords