Answers are grounded in this paper and cite their sources.
Demonstrates an upper bound on injective chromatic index in K4-minor free graphs, suggesting improved color usage.
An injective edge-coloring of a graph G is an edge-coloring φ ϕ of G , not necessarily proper, such that φ (e₁) ≠ φ (e₂) ϕ ( e 1 ) ≠ ϕ ( e 2 ) whenever there exists an edge e₃ e 3 adjacent to both e₁ e 1 and e₂ e 2 . In particular, edges in a triangle must receive distinct colors. The minimum number of colors needed in an injective edge-coloring of G , denoted by χ ᵢₙⱼ(G) χ inj ′ ( G ) , is called the injective chromatic index of G . In this paper, we study K₄ K 4 -minor free graphs, or equivalently, graphs with treewidth at most 2. Axenovich et al. [1] studied the injective chromatic index of graphs with treewidth at most k , and their result implies that every K₄ K 4 -minor free graph has injective chromatic index at most 9. This improves a linear bound established by Lv et al. [6] to a constant. For subcubic graphs, Kostochka et al. [5] showed that every subcubic planar graph has injective chromatic index at most 6, which implies that every subcubic K₄ K 4 -minor free graph has injective chromatic index at most 6. In the paper, we study K₄ K 4 -minor free graphs with maximum degree at most 4 and prove that every such graph has injective chromatic index at most 7.
No takes yet. Share an insight, caveat, or question.
Yu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: