Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

Yuehua BuKo-Wei LihWeifan Wang — 2011

Discussiones Mathematicae Graph Theory

An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu, and J. Wang,...

Page 1

Download Results (CSV)