Strong edge-coloring of $(3, \Delta)$-bipartite graphs
Discrete Mathematics
2015-08-19 v2 Combinatorics
Abstract
A strong edge-coloring of a graph 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 and the other part is of maximum degree . For every such graph, we prove that a strong -edge-coloring can always be obtained. Together with a result of Steger and Yu, this result confirms a conjecture of Faudree, Gy\'arf\'as, Schelp and Tuza for this class of graphs.
Cite
@article{arxiv.1412.2624,
title = {Strong edge-coloring of $(3, \Delta)$-bipartite graphs},
author = {Julien Bensmail and Aurélie Lagoutte and Petru Valicov},
journal= {arXiv preprint arXiv:1412.2624},
year = {2015}
}