Costa, Marie-Christinede Werra, DominiquePicouleau, ChristopheRies, Bernard2007-12-172007-12-172007-12-17200810.1007/s10288-008-0077-5https://infoscience.epfl.ch/handle/20.500.14299/15820WOS:000256312200001Starting from the basic image reconstruction problem in discrete tomography some graph theoretical models are proposed. This suggests the study of some variations and extensions of the basic problem. Applications in scheduling and timetabling are described. We exhibit polynomially solvable cases and we review the complexity status of some related problems.discrete tomographycomplete bipartite graphedge coloringtimetablingconstrained coloringschedulingA tutorial on the use of graphs in discrete tomographytext::journal::journal article::research article