论文信息 - Strong edge-coloring of $(3, \Delta)$-bipartite graphs

Strong edge-coloring of $(3, \Delta)$-bipartite graphs

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, Gyarfas, Schelp and Tuza for this class of graphs.

[1] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.

[2] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..

[3] Lars D@vling Andersen. The strong chromatic index of a cubic graph is at most 10 , 1992, Discret. Math..

[4] Michał Dębski,et al. Strong chromatic index of graphs , 2015 .

[5] Bruce A. Reed,et al. A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.

[6] V. Sós,et al. Irregularities of partitions , 1989 .

[7] Kittikorn Nakprasit,et al. A note on the strong chromatic index of bipartite graphs , 2008, Discret. Math..

[8] Richard A. Brualdi,et al. Incidence and strong edge colorings of graphs , 1993, Discret. Math..

[9] Mohammad Mahdian,et al. The strong chromatic index of graphs , 2000 .

[10] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .

[11] Hyeong-Ah Choi,et al. Graph Bipartization and via Minimization , 1989, SIAM J. Discret. Math..

[12] Daniel W. Cranston. Strong edge-coloring of graphs with maximum degree 4 using 22 colors , 2006, Discret. Math..