Decomposition of balanced matrices

DOI10.1006/jctb.1999.1932zbMath1023.05025MaRDI QIDQ1569060

N. Delaunay

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1932

zbMATH Keywords

recognition algorithm; balanced \((0,1)\) matrix

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing balancedness and perfection of linear matrices
• Decomposition of regular matroids
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Properties of balanced and perfect matrices
• Structural properties and decomposition of linear balanced matrices
• Odd cycles and matrices with integrality properties
• Minimax relations for the partial q-colorings of a graph
• Compositions for perfect graphs
• Perfect matchings in balanced hypergraphs
• Characterizations of totally balanced matrices
• On a Class of Totally Unimodular Matrices
• Totally-Balanced and Greedy Matrices
• Structural properties and recognition of restricted and strongly unimodular matrices
• A Combinatorial Decomposition Theory
• Balanced matrices and property (G)
• A sufficient condition for a matrix to be totally unimodular
• Perfect Elimination and Chordal Bipartite Graphs
• On Representatives of Subsets
• Characterization of Totally Unimodular Matrices
• Balanced matrices