scientific article; zbMATH DE number 3557519

Cited in

(63)

On the integer properties of scheduling set partitioning models
Recognizing max-flow min-cut path matrices
A note on odd/even cycles
On the 0,1 facets of the set covering polytope
Complement total unimodularity
Discrete extremal problems
Alpha-balanced graphs and matrices and GF(3)-representability of matroids
Structural properties and decomposition of linear balanced matrices
A decomposition theory for matroids. VII: Analysis of minimal violation matrices
Local unimodularity of matrix-vector pairs
An exact algorithm for multiple depot bus scheduling
Balanced matrices with row sum 3
Resolution and the integrality of satisfiability problems
One-node cutsets and the dominating set polytope
Restricted coloring models for timetabling
Decomposition of balanced matrices
On complexities of minus domination
On the mixed set covering, packing and partitioning polytope
Minimax relations for the partial q-colorings of a graph
Balanced \(0,\pm 1\) matrices. I: Decomposition
Reliability, covering and balanced matrices
Restrictions and preassignments in preemptive open shop scheduling
Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
Star partitions on graphs
Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
On the equality of symbolic and ordinary powers of binomial edge ideals
Efficient \((j, k)\)-dominating functions
On some graph classes related to perfect graphs: a survey
Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
Broadcast domination and multipacking in strongly chordal graphs
Balanced matrices
Perfect matchings in balanced hypergraphs
A polynomial recognition algorithm for balanced matrices
Recognizing balanceable matrices
On balanced graphs
Balancedness of some subclasses of circular-arc graphs
On complexities of minus domination
Maximum \(h\)-colourable subgraph problem in balanced graphs
A note on the duality between matchings and vertex covers in balanced hypergraphs
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
Covering, Packing and Generalized Perfection
A Class of Balanced Matrices Arising from Location Problems
Fractional dominating parameters
Standard graded vertex cover algebras, cycles and leaves
Totally-Balanced and Greedy Matrices
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
Weighted maximum-clique transversal sets of graphs
Stability of depth functions of cover ideals of balanced hypergraphs
Classes of normally and nearly normally torsion-free monomial ideals
On minimal forbidden subgraph characterizations of balanced graphs
On minimal forbidden subgraph characterizations of balanced graphs
Optimal design of line replaceable units
On a geometric graph-covering problem related to optimal safety-landing-site location
Recognizing integrality of weighted rectangles partitions
Decomposing probability marginals beyond affine requirements
On a geometric graph-covering problem related to optimal safety-landing-site location
Dominating set games.
Balanced Cayley graphs and balanced planar graphs
A characterization of oriented hypergraphic balance via signed weak walks
A min-max relation for the partial q-colourings of a graph. II: Box perfection
Domination, independent domination, and duality in strongly chordal graphs
Total weak unimodularity: Testing and applications
On the integrality of an extreme solution to pluperfect graph and balanced systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133404)