An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph and a family of chains together with vectors , one wants to find a partition of such that for each and each color , . An interpretation in terms of scheduling is presented.\ We consider special cases of graphs and identify polynomially solvable cases; general complexity results are established in this case and also in the case where is required to be a proper vertex -coloring of . Finally we examine also the case of (proper) edge -colorings and determine its complexity status.
David Atienza Alonso, Giovanni Ansaloni, José Angel Miranda Calero, Rubén Rodríguez Álvarez, Juan Pablo Sapriza Araujo, Benoît Walter Denkinger