On a graph coloring problem arising from discrete tomography

DOI10.1002/NET.20218MaRDI QIDQ3515882zbMATH OpenOpenAlexFDO

Authors Cédric Bentz, Marie-Christine Costa, Dominique De Werra, Bernard Ries, Christophe Picouleau

Publication date 29 July 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/326909/files/paths-rero.pdf

zbMATH Keywords

discrete tomographyedge coloringfamily of chainsschedulingvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• Using graphs for some discrete tomography problems
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• On the use of graphs in discrete tomography
• On the use of graphs in discrete tomography
• A solvable case of image reconstruction in discrete tomography

Cites work

• Combinatorial Properties of Matrices of Zeros and Ones
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(10)

• Graph coloring with cardinality constraints on the neighborhoods
• On the approximability of the maximum interval constrained coloring problem
• Histogram tomography
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• Using graphs for some discrete tomography problems
• Tomography on Finite Graphs
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• On the use of graphs in discrete tomography
• On the use of graphs in discrete tomography
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem

This page was built for publication: On a graph coloring problem arising from discrete tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515882)