Pages that link to "Item:Q4173379"
From MaRDI portal
The following pages link to A Minimax Theorem for Directed Graphs (Q4173379):
Displaying 31 items.
- Khovanov-Rozansky homology and directed cycles (Q2408110) (← links)
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Acyclic subgraphs of planar digraphs (Q2517654) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- Note on a min-max conjecture of Woodall (Q2746483) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- The positive circuits of oriented matroids with the packing property or idealness (Q2883575) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Euler Digraphs (Q3120436) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- On the acyclic subgraph polytope (Q3698818) (← links)
- Polyhedra related to a lattice (Q3911666) (← links)
- (Q4637014) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Ideal Clutters That Do Not Pack (Q5219553) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- On the infinite Lucchesi–Younger conjecture I (Q6056771) (← links)
- On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations (Q6093584) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
