Xiaoyu Liu

On Injective Edge-Colorings of Graphs Without a $$K_4$$- or a $$K_5$$-minor

Abstract An injective edge-coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges e and f receive distinct colors whenever 1) e and f are in a common triangle; or 2) $$\{e,f\}$$ { e , f } forms a matching and there is a third edge adjacent...