Nonredundant 1’s in $\Gamma $-Free Matrices

DOI10.1137/S0895480191197210zbMath0837.05028OpenAlexW2060352617MaRDI QIDQ4837651

Jeremy P. Spinrad

Publication date: 3 July 1995

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480191197210

zbMATH Keywords

chordal graphs\(\Gamma\)-free matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (12)

Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs ⋮ Perspectives of Monge properties in optimization ⋮ 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 ⋮ Recent developments on graphs of bounded clique-width ⋮ Boundary properties of graphs for algorithmic graph problems ⋮ Graph parameters, implicit representations and factorial properties ⋮ Graph classes and the switch Markov chain for matchings ⋮ Boundary Properties of Factorial Classes of Graphs ⋮ Chordal bipartite graphs of bounded tree- and clique-width

This page was built for publication: Nonredundant 1’s in $\Gamma $-Free Matrices