@article{Tang2023, 
author = {Yunfeng Tang and Huixin Yin and Miaomiao Han},
title = {Star edge coloring of        K          2      ,      t      -free planar graphs},
year = {2023},
journal = {AIMS Mathematics},
volume = {8},
number = {6},
pages = {13154-13161},
keywords = {coloring, star edge coloring, planar graph, edge-partition},
url = {https://www.sciopen.com/article/10.3934/math.2023664},
doi = {10.3934/math.2023664},
abstract = {The star chromatic index of a graph    G, denoted by    χ                            ′                    s      t        (  G  ), is the smallest number of colors required to properly color    E  (  G  ) such that every connected bicolored subgraph is a path with no more than three edges. A graph is        K          2      ,      t      -free if it contains no        K          2      ,      t       as a subgraph. This paper proves that every        K          2      ,      t      -free planar graph    G satisfies        χ          s      t        ′    (  G  )  ≤  1.5  Δ  +  20  t  +  20, which is sharp up to the constant term. In particular, our result provides a common generalization of previous results on star edge coloring of outerplanar graphs by Bezegová et al.(2016) and of        C    4  -free planar graphs by Wang et al.(2018), as those graphs are subclasses of        K          2      ,      3      -free planar graphs.}
}