The strong edge colorings of a sparse random graph

Zbigniew Palka
1998 The Australasian Journal of Combinatorics  
The strong chromatic index of a graph G is the smallest integer k such that the edge set E( G) can be partitioned into k induced subgraphs of G which form matchings. In this paper we consider the behavior of the strong chromatic index of a sparse random graph K (n, p), where p = p(n) = 0(1).
dblp:journals/ajc/Palka98 fatcat:6resg6tsg5exxk4s2s27qmhm24