A generalization of chromatic index


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

Similar works

Full text


Elsevier - Publisher Connector

Provided a free PDF
Last time updated on 4/28/2017View original full text link

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.