Abstract
The strong chromatic index s ′ ( G ) is the minimum integer t such that there is an edge-coloring of G with t colors in which every color class is an induced matching. Brualdi and Quinn conjecture that for every bipartite graph G, s ′ ( G ) is bounded by Δ 1 Δ 2 , where Δ 1 and Δ 2 are the maximum degrees among vertices in the two partite sets. We give the affirmative answer for Δ 1 = 2 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
