On star edge colorings of bipartite and subcubic graphs

Star edge-coloring of square grids

“…Recently, Casselgren et al [2] considered complete bipartite graphs and proved the tight upper bound for K 3, r , r ≥ 5, derived a lower and upper bound for K 4, s , s ≥ 4, and, using computer, they also determined the star chromatic index for some complete bipartite graphs of small order.…”

“…Star edge-coloring has been studied also for other classes of graphs, e.g., graphs with maximum degree 3 [3,6,7] and 4 [14] , subcubic Halin graphs [2] , outerplanar graphs [1,13] , and planar graphs with various constraints [13] . Moreover, the list version of the star edge-coloring has also been investigated (see, e.g., [5,9] ).…”

Star Edge-Coloring of Square Grids

“…Star edge-coloring has been studied also for other classes of graphs, e.g., graphs with maximum degree 3 [3] and 4 [12], subcubic Halin graphs [2], outerplanar graphs [1,11], and planar graphs with various constraints [11]. Moreover, the list version of the star edge-coloring has also been investigated (see, e.g., [5,7]).…”