Strong edge coloring of subcubic graphs

Hervé Hocquard (1) , Petru Valicov (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

A strong edge colouring of a graph $G$ is a proper edge colouring such that every path of length 3 uses three colours. In this paper, we prove that every subcubic graph with maximum average degree strictly less than $\frac{15}{7}$ (resp. $\frac{27}{11}$, $\frac{13}{5}$, $\frac{36}{13}$) can be strong edge coloured with six (resp. seven, eight, nine) colours.

Domaines: Mathématique discrète [cs.DM]

Hervé Hocquard, Petru Valicov. Strong edge coloring of subcubic graphs. Discrete Applied Mathematics, 2011, 159 (15), pp.1650-1657. ⟨10.1016/j.dam.2011.06.015⟩. ⟨hal-00592185⟩