Nonredundant 1’s in $\Gamma $-Free Matrices
From MaRDI portal
Publication:4837651
DOI10.1137/S0895480191197210zbMath0837.05028MaRDI QIDQ4837651
Publication date: 3 July 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C30: Enumeration in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Boundary Properties of Factorial Classes of Graphs, Graph classes and the switch Markov chain for matchings, Locally bounded coverings and factorial properties of graphs, On factorial properties of chordal bipartite graphs, Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices, Implicit representations and factorial properties of graphs, Boundary properties of graphs for algorithmic graph problems, Recent developments on graphs of bounded clique-width, Chordal bipartite graphs of bounded tree- and clique-width, Perspectives of Monge properties in optimization