Learn More
The strong chromatic index of a graph G is the minimum integer k such that the edge set of G can be partitioned into k induced matchings. Faudree et al. (1990) 205–211] proposed an open problem: If G is bipartite and if for each edge x y ∈ E(G), d(x) + d(y) ≤ 5, then sχ (G) ≤ 6. Let H 0 be the graph obtained from a 5-cycle by adding a new vertex and joining(More)
  • 1