scientific article; zbMATH DE number 3557519
From MaRDI portal
Publication:4133404
zbMATH Open0357.90038MaRDI QIDQ4133404FDOQ4133404
Authors: D. R. Fulkerson, Alan J. Hoffman, R. Oppenheim 
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (59)
- Optimal design of line replaceable units
- Fractional dominating parameters
- On complexities of minus domination
- On minimal forbidden subgraph characterizations of balanced graphs
- Dominating set games.
- Totally-Balanced and Greedy Matrices
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- On the equality of symbolic and ordinary powers of binomial edge ideals
- Broadcast domination and multipacking in strongly chordal graphs
- Weighted maximum-clique transversal sets of graphs
- Efficient \((j, k)\)-dominating functions
- Resolution and the integrality of satisfiability problems
- Recognizing max-flow min-cut path matrices
- 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
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Balanced Cayley graphs and balanced planar graphs
- On complexities of minus domination
- Reliability, covering and balanced matrices
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- A note on odd/even cycles
- On the mixed set covering, packing and partitioning polytope
- On minimal forbidden subgraph characterizations of balanced graphs
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- A note on the duality between matchings and vertex covers in balanced hypergraphs
- Stability of depth functions of cover ideals of balanced hypergraphs
- Domination, independent domination, and duality in strongly chordal graphs
- Restrictions and preassignments in preemptive open shop scheduling
- Discrete extremal problems
- On some graph classes related to perfect graphs: a survey
- Recognizing balanceable matrices
- A characterization of oriented hypergraphic balance via signed weak walks
- On the 0,1 facets of the set covering polytope
- Balanced matrices
- Covering, Packing and Generalized Perfection
- Minimax relations for the partial q-colorings of a graph
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- Total weak unimodularity: Testing and applications
- Classes of normally and nearly normally torsion-free monomial ideals
- A Class of Balanced Matrices Arising from Location Problems
- An exact algorithm for multiple depot bus scheduling
- Balanced matrices with row sum 3
- Decomposition of balanced matrices
- Restricted coloring models for timetabling
- On the integer properties of scheduling set partitioning models
- Standard graded vertex cover algebras, cycles and leaves
- Complement total unimodularity
- One-node cutsets and the dominating set polytope
- Star partitions on graphs
- On the integrality of an extreme solution to pluperfect graph and balanced systems
- Balancedness of some subclasses of circular-arc graphs
- A polynomial recognition algorithm for balanced matrices
- Perfect matchings in balanced hypergraphs
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- On balanced graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
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)
