Cited in
(38)- On the realization of a (p,s)-digraph with prescribed degrees
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs
- Sufficient conditions for graphicality of bidegree sequences
- Relaxed and approximate graph realizations
- Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
- Results on the small quasi-kernel conjecture
- Realizability and uniqueness in graphs
- Directed star decompositions of the complete directed graph
- Binary vectors partially determined by linear equation systems
- Leaf realization problem, caterpillar graphs and prefix normal words
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- Matrices of zeros and ones with fixed row and column sum vectors
- Graph realizations: maximum degree in vertex neighborhoods
- A study of the total chromatic number of equibipartite graphs
- Exact sampling of graphs with prescribed degree correlations
- Enumeration and simulation methods for 0-1 matrices with given marginals
- A note on matrics with given diagonal entries
- Matrices of zeros and ones
- Characterization of digraphic sequences with strongly connected realizations
- Tournaments, oriented graphs and football sequences
- Constructing and sampling directed graphs with given degree sequences
- Approximate graph colouring and the hollow shadow
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Directed Networks with a Differentially Private Bi-degree Sequence
- Triangular (0,1)-matrices with prescribed row and column sums
- Bidimensional allocation of seats via zero-one matrices with given line sums
- Degree sequence for \(k\)-arc strongly connected multiple digraphs
- Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- A note on the characterization of digraphic sequences
- On the swap-distances of different realizations of a graphical degree sequence
- Dag realizations of directed degree sequences
- Efficiently realizing interval sequences
- Integral matrices with given row and column sums
- Split digraphs
- The k-factor conjecture is true
This page was built for publication: Zero-one matrices with zero trace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q773068)
