Pages that link to "Item:Q3884120"
From MaRDI portal
The following pages link to Properties of a Class of (0,1)-Matrices Covering a given Matrix (Q3884120):
Displaying 16 items.
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros (Q501232) (← links)
- Bidimensional allocation of seats via zero-one matrices with given line sums (Q744674) (← links)
- The network flows approach for matrices with given row and column sums (Q1052337) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Triangular (0,1)-matrices with prescribed row and column sums (Q1164689) (← links)
- Integral matrices with given row and column sums (Q1199992) (← links)
- On the upper bound of the diameter of interchange graphs (Q1296994) (← links)
- Binary vectors partially determined by linear equation systems (Q1363682) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence (Q2365681) (← links)
- The structure matrix and a generalization of Ryser's maximum term rank formula (Q2639928) (← links)
- Sufficient Conditions for Graphicality of Bidegree Sequences (Q2953405) (← links)
- An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors (Q3035298) (← links)
- Efficiently Realizing Interval Sequences (Q5138976) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
