Strong edge-colouring and induced matchings

Authors:
Hervé Hocquard;Pascal Ochem;Petru Valicov
Affiliations:
LaBRI (Université Bordeaux 1), 351 cours de la Libération, 33405 Talence Cedex, France;LIRMM - CNRS, 161 rue Ada, 34095 Montpellier Cedex 5, France;LaBRI (Université Bordeaux 1), 351 cours de la Libération, 33405 Talence Cedex, France
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Induced matchings in bipartite graphs

Discrete Mathematics - In memory of Tory Parsons
A special planar satisfiability problem and a consequence of its NP-completeness

Discrete Applied Mathematics
On the computational complexity of strong edge coloring

Discrete Applied Mathematics
A polynomial time algorithm for strong edge coloring of partial k-trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three 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 some subclasses of subcubic triangle-free 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.