Sort by: Order: Results:

  • Dara, Suresh; Mishra, Suchismita; Narayanan, Narayanan; Tuza, Zsolt (Springer, 2022-04)
    A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper we determine ...

Search Digital Repository


My Account