The following pages link to (Q4133404):
Displaying 50 items.
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Dominating set games. (Q703283) (← links)
- Balanced Cayley graphs and balanced planar graphs (Q712243) (← links)
- A characterization of oriented hypergraphic balance via signed weak walks (Q745211) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- Complement total unimodularity (Q1143465) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids (Q1160629) (← links)
- Structural properties and decomposition of linear balanced matrices (Q1196165) (← links)
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices (Q1204474) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- An exact algorithm for multiple depot bus scheduling (Q1319568) (← links)
- Balanced matrices with row sum 3 (Q1336681) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- On complexities of minus domination (Q1751171) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- Star partitions on graphs (Q2010910) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- On the equality of symbolic and ordinary powers of binomial edge ideals (Q2106567) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- Balanced matrices (Q2433704) (← links)
- Perfect matchings in balanced hypergraphs (Q2563509) (← links)
- A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
- Recognizing balanceable matrices (Q2583120) (← links)
- On balanced graphs (Q2583124) (← links)
- (Q2861542) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
