On a star chromatic index of subcubic graphs

https://doi.org/10.1016/j.endm.2017.07.043Get rights and content

Abstract

A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. We consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7, answering the question of Dvořák et al. in [Dvořák, Z., B. Mohar, and R. Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326].

References (4)

  • L. Bezegová et al.

    Star edge coloring of some classes of graphs

    J. Graph Theory

    (2016)
  • Z. Dvořák et al.

    Star chromatic index

    J. Graph Theory

    (2013)
There are more references available in the full text version of this article.

Cited by (6)

1

Supported by project GA17–04611S of the Czech Science Foundation and by project LO1506 of the Czech Ministry of Education, Youth and Sports.

View full text