A decomposition of a non-empty simple graph G is a pair [G,P] such that P is a set of non-empty induced subgraphs of G, and every edge of G belongs to exactly one subgraph in P. The chromatic index ¿'([G,P]) of a decomposition ...

A k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ...

This paper studies the computational complexity of the proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ...

A k-coloring of a graph G is a partition of the vertices of G into k independent sets, which are called colors. A k-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from ...

Ak-coloringof a graphGis a partition of the vertices ofGintokindependent sets,which are calledcolors. Ak-coloring isneighbor-locatingif any two vertices belongingto the same color can be distinguished from each other by ...