Induced matchings in bipartite graphs
Discrete Mathematics - In memory of Tory Parsons
On strong edge-colouring of subcubic graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
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 157 (resp. 2711, 135, 3613) can be strong edge coloured with six (resp. seven, eight, nine) colours.