Decomposition of balanced matrices
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Decomposition Theory
- A sufficient condition for a matrix to be totally unimodular
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Balanced matrices
- Balanced matrices and property (G)
- Characterization of Totally Unimodular Matrices
- Characterizations of totally balanced matrices
- Compositions for perfect graphs
- Decomposition of regular matroids
- scientific article; zbMATH DE number 3882481 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3327126 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- Minimax relations for the partial q-colorings of a graph
- Odd cycles and matrices with integrality properties
- On a Class of Totally Unimodular Matrices
- On Representatives of Subsets
- Perfect Elimination and Chordal Bipartite Graphs
- Perfect matchings in balanced hypergraphs
- Properties of balanced and perfect matrices
- Structural properties and decomposition of linear balanced matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- Testing balancedness and perfection of linear matrices
- Totally-Balanced and Greedy Matrices
Cited in
(37)- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Structural properties and decomposition of linear balanced matrices
- Balanced matrices with row sum 3
- Square-free perfect graphs.
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- Oriented hypergraphs: balanceability
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Detecting 2-joins faster
- Balanced matrices
- 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
- A polynomial recognition algorithm for balanced matrices
- Recognizing balanceable matrices
- On balanced graphs
- Even-hole-free graphs. I: Decomposition theorem
- Linear balanceable and subcubic balanceable graphs
- A unified approach to recognize squares of split graphs
- Even-hole-free graphs part II: Recognition algorithm
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Characterizations of totally balanced matrices
- Graph minor theory
- scientific article; zbMATH DE number 3935230 (Why is no real title available?)
- Oriented hypergraphs: introduction and balance
- scientific article; zbMATH DE number 30950 (Why is no real title available?)
- scientific article; zbMATH DE number 1496606 (Why is no real title available?)
- Enumerating minimal transversals of hypergraphs without small holes
- Probe Matrix Problems: Totally Balanced Matrices
- On the existence of duality gaps for mixed integer programming
- Perfect, ideal and balanced matrices
- Recognizing integrality of weighted rectangles partitions
- Balanced Cayley graphs and balanced planar graphs
- A characterization of oriented hypergraphic balance via signed weak walks
- Combinatorial optimization with 2-joins
This page was built for publication: Decomposition of balanced matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569060)
