Pages that link to "Item:Q4173379"
From MaRDI portal
The following pages link to A Minimax Theorem for Directed Graphs (Q4173379):
Displaying 50 items.
- Disjoint dijoins (Q290802) (← links)
- Intersection properties of maximal directed cuts in digraphs (Q329544) (← links)
- Approximate min-max relations on plane graphs (Q358640) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Fractional packing in ideal clutters (Q431029) (← links)
- Small feedback vertex sets in planar digraphs (Q528978) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- A counterexample to a conjecture of Edmonds and Giles (Q1145156) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- On two minimax theorems in graph (Q1229885) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Canonical modules of certain edge subrings (Q1399683) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Forcing matchings on square grids (Q1584401) (← links)
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Anti-forcing polynomials for benzenoid systems with forcing edges (Q1801080) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- Singularities of toric varieties associated with finite distributive lattices (Q1915159) (← links)
- Packing circuits in eulerian digraphs (Q1924492) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- A new infinite class of ideal minimally non-packing clutters (Q2032738) (← links)
- The star dichromatic number (Q2062686) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes (Q2139808) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Idealness and 2-resistant sets (Q2294336) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
