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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 170; s. 106121
Hlavní autori:	Foucaud, Florent, Hocquard, Hervé, Lajou, Dimitri
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2021 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!