Abstract
AbstractAn adjacent vertex distinguishing edge coloring of a graph G without isolated edges is its proper edge coloring such that no pair of adjacent vertices meets the same set of colors in G. We show that such coloring can be chosen from any set of lists associated to the edges of G as long as the size of every list is at least , where Δ is the maximum degree of G and C is a constant. The proof is probabilistic. The same is true in the environment of total colorings.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call