Consecutive Colorings of the Edges of Some Tricyclic Graphs
Shiying Wang · Journal of Taiyuan University of Science and Technology · 2007
Given a simple graph G,a proper edge-coloring of G with color 1,2,3,…is called consecutive if the colors represented at each vertex form an interval of integers.The deficiency of G def(G) is the minimum number of pendant edges whose attachment to G makes it consecutively colorable.In this paper,we determine their deficiencies and discuss their consecutive dege-colorings for some tricyclic graphs.