Faculty of Mathematics, Physics
and Informatics
Comenius University Bratislava

Seminar of Graph Theory - Roman Soták (17.5.2018)

Thursday 17.5.2018 at 9:50, Lecture room M/213


15. 05. 2018 09.57 hod.
By: Martin Škoviera

Roman Soták (UPJŠ Košice):
Star and List star edge-coloring of graphs

Abstract:
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this talk, we present bounds for various classes of graphs. In particular, we focus to the list version of this edge-coloring and prove that the list star chromatic index of every subcubic graph is at most 7, answering the question of Dvo\v{r}\'{a}k et al. (Dvo\v{r}\'{a}k, Mohar, and \v{S}\'{’a}mal, Star chromatic index, J. Graph Theory 72 (2013), 313 -326).