Degree-constrained edge partitioning in graphs arising from discrete tomography

DOI10.7155/jgaa.00178zbMath1210.05036OpenAlexW2101889748MaRDI QIDQ3627968

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

Publication date: 19 May 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/45461

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Colour degree matrices of graphs with at most one cycle ⋮ Half-regular factorizations of the complete bipartite graph ⋮ Packing tree degree sequences ⋮ Constructing bounded degree graphs with prescribed degree and neighbor degree sequences ⋮ Edge disjoint caterpillar realizations ⋮ Solving the Two Color Problem: An Heuristic Algorithm ⋮ On the use of graphs in discrete tomography ⋮ On the use of graphs in discrete tomography ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition

This page was built for publication: Degree-constrained edge partitioning in graphs arising from discrete tomography