Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
From MaRDI portal
(Redirected from Publication:617894)
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
Cites work
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- A short proof of Kundu's k-factor theorem
- A solvable case of image reconstruction in discrete tomography
- A theorem on flows in networks
- Algorithms for constructing graphs and digraphs with given valences and factors
- Combinatorial Properties of Matrices of Zeros and Ones
- Discrete tomography. Foundations, algorithms, and applications
- Matrices of zeros and ones with fixed row and column sum vectors
- On factorable degree sequences
- On joint realization of (0,1) matrices
- On the computational complexity of determining polyatomic structures by X-rays
- On the use of graphs in discrete tomography
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Studies on directed graphs. I, II
- The k-factor conjecture is true
- Using graphs for some discrete tomography problems
- Valencies of graphs with 1-factors
Cited in
(12)- Degree-constrained edge partitioning in graphs arising from discrete tomography
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
- Half-regular factorizations of the complete bipartite graph
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- Packing tree degree sequences
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- A note on packing of graphic \(n\)-tuples
- A formulation of the wide partition conjecture using the atom problem in discrete tomography
- Colour degree matrices of graphs with at most one cycle
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
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)
