Bentz, Cédric Costa, Marie-Christine Picouleau, Christophe Ries, Bernard de Werra, Dominique 2009 Starting from the basic problem of reconstructing a 2-dimensional im- age given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1 and 2) has a given structure (tree, vertex- disjoint chains, 2-factor, etc.). We also study special cases corresponding to the search of 2 edge-disjoint chains or cycles going through speci ed vertices. A variation where the graph is oriented is also presented. In addition we explore similar problems for the case where the under- lying graph is a complete graph (instead of a complete bipartite graph). application/pdf https://folia.unifr.ch/global/documents/307829 https://folia.unifr.ch/documents/307829/files/discretetomography.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.7155/jgaa.00178 info:eu-repo/semantics/openAccess License undefined Journal of Graph Algorithms and Applications. - 2009, vol. 13, no. 2, p. 99-118 Graph theory Discrete Mathematics Theoretical Computer Science Algorithms info:eu-repo/classification/udc/004 Degree-constrained edge partitioning in graphs arising from discrete tomography http://purl.org/coar/resource_type/c_6501