Consecutive Colorings of the Edges of Unicyclic and Bicyclic Graphs
Weijuan Zhang · Shinjang dashösi ilmiy jurnili · 2006
Given a simple graph G,a proper edge-coloring of G with colors 1,2, 3,… is called consecutive if the colors represented at each vertex form an interval of integers.The deficiency def(G) of G is the minimum number of pendant edges whose attachment to G makes it consecutively colorable.In this paper,we completely determine the deficiency of unicyclic and bicyclic graphs.