arXiv:2210.05915v2 [math.CO] 22 Apr 2023 Page 1 arXiv:2210.05915v2 [math.CO] 22 Apr
2023 Coloring, List Coloring, and Painting Squares of Graphs (and other related problems) …

A strong edge-coloring of a graph $ G $ is a coloring of the edges such that every color class
induces a matching in $ G $. The strong chromatic index of a graph is the minimum number …

A strong edge-coloring of a graph is a proper edge-coloring where the edges at distance at
most 2 receive distinct colors. It is known that every planar graph G has a strong edge …

Recent progress on strong edge-coloring of graphs Page 1 Discrete Mathematics, Algorithms
and Applications Vol. 11, No. 5 (2019) 1950062 (21 pages) c© World Scientific Publishing …

The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-
colored requiring that each color class induces a matching. We verify a conjecture of …

A strong edge-colouring of a graph G is a proper edge-colouring such that every path of
length 3 uses three different colours. In this paper we improve some previous results on the …

The strong chromatic index of a graph G, denoted by χ s′(G), is the least number of colors
needed to edge-color G properly so that every path of length 3 uses three different colors. In …

A strong edge-coloring of a graph G is a proper edge-coloring such that every path of length
3 uses three different colors. The strong chromatic index of G, denoted by χ s′(G), is the …

The strong chromatic index of a graph $ G $, denoted $\chi_s'(G) $, is the least number of
colors needed to edge-color $ G $ so that edges at distance at most two receive distinct …

On strong list edge coloring of subcubic graphs - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Help Search My account Sign in View PDF Download full …