Adjacent Vertex Distinguishing Proper Edge Colorings of Bicyclic Graphs

An adjacent vertex distinguishing proper edge coloring of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let x'a(G) be the minimum number of colors required to give G an adjacent vertex distinguishing proper edge coloring. In this p...

Full description

Saved in:
Bibliographic Details
Published inIAENG international journal of applied mathematics Vol. 48; no. 4; pp. 1 - 11
Main Authors Chen, Xiang'en, Liu, Shunyi
Format Journal Article
LanguageEnglish
Published Hong Kong International Association of Engineers 01.11.2018
Subjects
Online AccessGet full text

Cover

Loading…