Decomposition of balanced matrices
From MaRDI portal
Publication:1569060
DOI10.1006/jctb.1999.1932zbMath1023.05025OpenAlexW1995303433MaRDI QIDQ1569060
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
Related Items
Oriented hypergraphs: balanceability, Detecting 2-joins faster, A unified approach to recognize squares of split graphs, Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, Oriented hypergraphs: introduction and balance, Balanced matrices, Square-free perfect graphs., Unnamed Item, Enumerating Minimal Transversals of Hypergraphs without Small Holes, Solution of three problems of Cornuéjols, Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs, A sufficient condition for the bicolorability of a hypergraph, Perfect, ideal and balanced matrices, Even-hole-free graphs part I: Decomposition theorem, Balanced Cayley graphs and balanced planar graphs, Graph minor theory, On the existence of duality gaps for mixed integer programming, A characterization of oriented hypergraphic balance via signed weak walks, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Combinatorial optimization with 2-joins, A polynomial recognition algorithm for balanced matrices, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Balanced \(0,\pm 1\) matrices. I: Decomposition, Balanced \(0,\pm 1\) matrices. II: Recognition algorithm, Recognizing balanceable matrices, On balanced graphs, Linear Balanceable and Subcubic Balanceable Graphs*, Even-hole-free graphs part II: Recognition algorithm
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
