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 proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It
is well known that for a strong edge coloring of ak k‐regular graph at least 2 k− 1 2k-1 colors …

An induced matching in a graph $ G $ is a matching such that its end vertices also induce a
matching. A $(1^{\ell}, 2^ k) $-packing edge-coloring of a graph $ G $ is a partition of its …

For a nondecreasing sequence S=(s 1,…, sk) S=(s_1,...,s_k) of positive integers, an SS‐
packing edge‐coloring of a graph GG is a decomposition of edges of GG into disjoint sets E …

For a sequence $ S=(s_1,\ldots, s_k) $ of non-decreasing integers, a packing $ S $-coloring
of a graph $ G $ is a partition of its vertex set $ V (G) $ into $ V_1,\ldots, V_k $ such that for …

Abstract A matching MM in a graph GG is semistrong if every edge of MM has an endvertex
of degree one in the subgraph induced by the vertices of M M. A semistrong edge‐coloring …

A packing $(1^{\ell}, 2^ k) $-coloring of a graph $ G $ is a partition of $ V (G) $ into $\ell $
independent sets and $ k $ $2 $-independent sets (whose pairwise vertex distance is at …

For a sequence $ S=(s_1, s_2,\ldots, s_k) $ of non-decreasing positive integers, an $ S $-
packing edge-coloring (S-coloring) of a graph $ G $ is a partition of $ E (G) $ into $ E_1 …

Let $ G=(V (G), E (G)) $ be a graph with maximum degree $\Delta $. For a subset $ M $ of $
E (G) $, we denote by $ G [V (M)] $ the subgraph of $ G $ induced by the endvertices of …

I defended my PhD thesis on December 5, 2011. That same day, while I was receiving the
congratulations of circumstances, André Raspaud came to me and asked me when I was …