The following pages link to On two minimax theorems in graph (Q1229885):
Displaying 50 items.
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Intersection properties of maximal directed cuts in digraphs (Q329544) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- Projections, entropy and sumsets (Q452821) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- An algorithm for optimum common root functions of two digraphs (Q688253) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← 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)
- Galois geometries and coding theory (Q908053) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061) (← links)
- On the orientation of graphs (Q1144041) (← links)
- 2-linked graphs (Q1150633) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- Edge-disjoint branching in directed multigraphs (Q1255784) (← links)
- Solution of two fractional packing problems of Lovász (Q1260046) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On totally dual integral systems (Q1824553) (← links)
- A faster algorithm for finding edge-disjoint branchings (Q1838313) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Packing circuits in eulerian digraphs (Q1924492) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Smallest number of vertices in a 2-arc-strong digraph without good pairs (Q2087467) (← links)
- Non-separating spanning trees and out-branchings in digraphs of independence number 2 (Q2102758) (← links)
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
- Note on a min-max conjecture of Woodall (Q2746483) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths (Q2833123) (← links)
- Polyhedra related to a lattice (Q3911666) (← links)
