The strong chromatic index of $(3,\Delta)$-bipartite graphs
Combinatorics
2018-06-20 v1
Abstract
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. We study bipartite graphs with one part having maximum degree at most and the other part having maximum degree . We show that every such graph has a strong edge-coloring using at most colors. Our result confirms a conjecture of Brualdi and Quinn Massey ~\cite{[BQ]} for this class of bipartite graphs.
Keywords
Cite
@article{arxiv.1806.07017,
title = {The strong chromatic index of $(3,\Delta)$-bipartite graphs},
author = {Mingfang Huang and Gexin Yu and Xiangqian Zhou},
journal= {arXiv preprint arXiv:1806.07017},
year = {2018}
}