Complexity and algorithms for injective edge-coloring in graphs

•We start a systematic study of the complexity of INJECTIVE k-EDGE-COLORING.•INJECTIVE k-EDGE-COLORING for k=3,4 is hard for restricted classes of subcubic graphs.•INJECTIVE k-EDGE-COLORING is linear-time solvable on graphs of bounded treewidth.•All planar bipartite subcubic graphs of girth 16 are i...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 170; p. 106121
Main Authors:	Foucaud, Florent, Hocquard, Hervé, Lajou, Dimitri
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2021 Elsevier
Subjects:	Computer Science Data Structures and Algorithms Graph algorithms Injective edge-coloring Planar graphs Subcubic graphs Treewidth Subcubic graphs Graph algorithms Injective edge-coloring Planar graphs Treewidth
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!