Not all graphs have consecutive colorings. The deficiency def(G) of G is the minimum number of pendant edges whoseattachment to G makes it consecutively colorable [9].

• 图G的亏度def(G)是粘在G上使得它可连续着色的悬挂边的最小数目[9].