Bounds and complexity results for strong edge colouring of subcubic graphs

Abstract : 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 give some upper bounds for the minimum number of colours in a strong edge colouring of subcubic graphs as a function of the maximum average degree. We also prove the NP-completeness of the strong edge $k$-colouring problem for some restricted classes of subcubic planar graphs when $k=4,5,6$.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00592130
Contributor : Petru Valicov <>
Submitted on : Wednesday, May 11, 2011 - 1:40:18 PM
Last modification on : Tuesday, April 24, 2018 - 1:38:27 PM
Long-term archiving on : Friday, November 9, 2012 - 11:10:21 AM

File

abstract.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00592130, version 1

Collections

Citation

Hervé Hocquard, Pascal Ochem, Petru Valicov. Bounds and complexity results for strong edge colouring of subcubic graphs. EuroComb'11, Aug 2011, Budapest, France. A paraitre. ⟨hal-00592130⟩

Share

Metrics

Record views

239

Files downloads

137