| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419908 | Discrete Applied Mathematics | 2011 | 8 Pages |
Abstract
A strong edge colouring of a graph GG 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.
► Study of the strong edge colouring parameter for subcubic graphs. ► Maximum average degree (MAD) and upper bounds for strong edge colouring. ► Relevance of the bounds given by the MAD parameter.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hervé Hocquard, Petru Valicov,