A vertex-distinguishing coloring of a graph G consists in an edge or a vertex coloring (not necessarily proper) of G leading to a labeling of the vertices of G, where all the vertices are distinguished by their labels. There are several possible rules for both the coloring and the labeling. For instance, in a set irregular edge coloring [5], the label of a vertex is the union of the colors of i...

Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...

A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G having no parity path (a parity edge-coloring). Let p̂(G) be the least number of colors in an edge-coloring of G having no open parity walk (a strong parity edge-coloring). Always p̂(G) ≥ p(G) ≥ χ′(G). We prove that p̂(Kn) = ...

A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G having no parity path (a parity edge-coloring). Let p̂(G) be the least number of colors in an edge-coloring of G having no open parity walk (a strong parity edge-coloring). Always p̂(G) ≥ p(G) ≥ χ′(G). We prove that p̂(Kn) = ...

An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). A graph is 1-planar if it can be drawn on the plane such that every edg...

For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices while ensuring that two edges that are adjacent, two vertices that are adjacent, or a vertex and an edge that ar...

For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or an -edge-coloring of G. The distance-edge-coloring problem is to compute the minimum number of colors required for a distance-edge-coloring of a given graph G. A partial k-tree is a graph with tree-width bounded by a f...

In the edge precoloring extension problem we are given a graph with some of the edges having a preassigned color and it has to be decided whether this coloring can be extended to a proper k-edge-coloring of the graph. In list edge coloring every edge has a list of admissible colors, and the question is whether there is a proper edge coloring where every edge receives a color from its list. We s...

A strong edge coloring of a graph G is an edge coloring such that every two adjacent edges or two edges adjacent to a same edge receive two distinct colors; in other words, every path of length three has three distinct colors in G. The strong chromatic index of G, denoted by   S G  , is the smallest integer k such that G admits a strong edge coloring with k colors. This survey is an brief i...