Pages that link to "Item:Q617894"
From MaRDI portal
The following pages link to Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894):
Displaying 11 items.
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- A note on packing of graphic \(n\)-tuples (Q501040) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Packing tree degree sequences (Q2175807) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) (← links)
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) (← links)
- Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography (Q2902905) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)