Strong edge-coloring of (3, Δ)-bipartite graphs [article]

Julien Bensmail
2015 arXiv   pre-print
A strong edge-coloring of a graph G is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most 3 and the other part is of maximum degree Δ. For every such graph, we prove that a strong 4Δ-edge-coloring can always be obtained. Together with a result of Steger and Yu, this result confirms a conjecture of Faudree, Gyárfás, Schelp and Tuza for this class of graphs.
arXiv:1412.2624v2 fatcat:jbj6yny4zzboha5k4lp5uiftly