Bounds and complexity results for strong edge colouring of subcubic graphs

Hervé Hocquard,Petru Valicov,Pascal Ochem

doi:10.1016/j.endm.2011.09.075

Bounds and complexity results for strong edge colouring of subcubic graphs

Hervé Hocquard, Petru Valicov + Show 1 more

Open Access

https://doi.org/10.1016/j.endm.2011.09.075

Copy DOI

Journal: Electronic Notes in Discrete Mathematics	Publication Date: Dec 1, 2011
License type: other-oa

Affiliation: University of Bordeaux, Laboratoire Bordelais de Recherche en Informatique, Institut Polytechnique de Bordeaux, University of Paris-Sud, Institut Polytechnique de Paris, Laboratoire de Recherche en Informatique, French National Centre for Scientific Research

#Colouring Of Graphs #Strong Colouring + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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 .

Full Text