Seminár z teórie grafov - Roman Soták (17.5.2018)

vo štvrtok 17.5.2018 o 9:50 hod. v miestnosti M/213

15. 05. 2018 09.52 hod.
Od: Martin Škoviera

Prednášajúci: Roman Soták (UPJŠ Košice)

Názov: Star and List star edge-coloring of graphs

Termín: 17.5.2018, 9:50 hod., M/213

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).