Strong edge-colouring and induced matchings - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2013

Strong edge-colouring and induced matchings

Résumé

A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three distinct colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5 and 6-edge-colouring and maximum induced matching in the case of some restricted subclasses of subcubic planar graphs. We also obtain a tight upper bound for the minimum number of colours in a strong edge-colouring of outerplanar graphs as a function of the maximum degree.
Fichier principal
Vignette du fichier
submission_version.pdf (219.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00609454 , version 1 (19-07-2011)
hal-00609454 , version 2 (04-01-2013)
hal-00609454 , version 3 (16-04-2013)
hal-00609454 , version 4 (28-07-2013)

Identifiants

Citer

Hervé Hocquard, Pascal Ochem, Petru Valicov. Strong edge-colouring and induced matchings. Information Processing Letters, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩. ⟨hal-00609454v4⟩
378 Consultations
647 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More