A generalization of chromatic index

Abstract

AbstractLet G = (V, E) be a graph and k ⩾ 2 an integer. The general chromatic index χ′k(G) of G is the minimum order of a partition P of E such that for any set F in P every component in the subgraph 〈F〉 induced sby F has size at most k - 1. This paper initiates a study of χ′k(G) and generalizes some known results on chromatic index