Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777010 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. We study bipartite graphs with one part having maximum degree at most 3 and the other part having maximum degree Î. We show that every such graph has a strong edge-coloring using at most 3Î colors. Our result confirms a conjecture of Brualdi and Quinn Massey (1993) for this class of bipartite graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mingfang Huang, Gexin Yu, Xiangqian Zhou,