On strong edge-colouring of subcubic graphs
On strong edge-colouring of subcubic graphs
复制标题
DOI:
10.1016/j.dam.2013.05.021
复制
发表时间:
2011-09
期刊:
影响因子:
--
通讯作者:
H. Hocquard;Mickaël Montassier;A. Raspaud;Petru Valicov
中科院分区:
文献类型:
--
作者:
H. Hocquard;Mickaël Montassier;A. Raspaud;Petru Valicov
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some previous results on the strong edge-colouring of subcubic graphs by showing that every subcubic graph with maximum average degree strictly less than 7 3 (resp. 5 2, 8 3, 20 7) can be strongly edge-coloured with six (resp. seven, eight, nine) colours. These upper bounds are optimal except the one of 8 3. Also, we prove that every subcubic planar graph without 4-cycles and 5-cycles can be strongly edge-coloured with nine colours.