Complexity and algorithms for injective edge-coloring in graphs
From MaRDI portal
Publication:6365437
DOI10.1016/j.ipl.2021.106121zbMath1516.68060arXiv2104.08003WikidataQ114167103 ScholiaQ114167103MaRDI QIDQ6365437
Hervé Hocquard, Dimitri Lajou, Florent Foucaud
Publication date: 16 April 2021
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Complexity and algorithms for injective edge-coloring in graphs