Incidence and strong edge colorings of graphs (Q1313849): Difference between revisions

The incidence coloring number of a graph is defined and bounded in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. A bound for the strong chromatic index of bipartite graphs all of whose cycle lengths are divisible by 4 is improved.