Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
DOI10.1016/J.DAM.2010.09.011zbMATH Open1226.05116OpenAlexW2017702547MaRDI QIDQ617894FDOQ617894
Authors: Martin Matamala, Flavio Guiñez, Stéphan Thomassé 
Publication date: 14 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.09.011
Recommendations
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- Discrete tomography and plane partitions
- Degree sequences and graphs with disjoint spanning trees
- Discrete tomography for the point sequence generated by the adjacent terms of a sequence
- An algebraic framework for discrete tomography: revealing the structure of dependencies
- Using graphs for some discrete tomography problems
- On a graph coloring problem arising from discrete tomography
- A tomographical interpretation of a sufficient condition on \(h\)-graphical sequences
- Discrete tomography for inscribable lattice sets
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Discrete tomography. Foundations, algorithms, and applications
- A theorem on flows in networks
- Title not available (Why is that?)
- Matrices of zeros and ones with fixed row and column sum vectors
- Algorithms for constructing graphs and digraphs with given valences and factors
- Combinatorial Properties of Matrices of Zeros and Ones
- A solvable case of image reconstruction in discrete tomography
- On the use of graphs in discrete tomography
- Using graphs for some discrete tomography problems
- A short proof of Kundu's k-factor theorem
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- Studies on directed graphs. I, II
- On joint realization of (0,1) matrices
- The k-factor conjecture is true
- Valencies of graphs with 1-factors
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- On the computational complexity of determining polyatomic structures by X-rays
- On factorable degree sequences
Cited In (12)
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- A formulation of the wide partition conjecture using the atom problem in discrete tomography
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- Colour degree matrices of graphs with at most one cycle
- Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
- Packing tree degree sequences
- Half-regular factorizations of the complete bipartite graph
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- A note on packing of graphic \(n\)-tuples
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
This page was built for publication: Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617894)
