On two minimax theorems in graph
From MaRDI portal
Cites work
- A Minimax Theorem for Directed Graphs
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3477226 (Why is no real title available?)
- scientific article; zbMATH DE number 3304771 (Why is no real title available?)
- Packing rooted directed cuts in a weighted directed graph
- Strong Covering of a Bipartite Graph
Cited in
(73)- Packing circuits in matroids
- Rooted \(k\)-connections in digraphs
- Polyhedral proof methods in combinatorial optimization
- A quick proof of Seymour's theorem on t-joins
- Directed cut transversal packing for source-sink connected graphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- On the orientation of graphs
- 2-linked graphs
- How to make a digraph strongly connected
- Edge-disjoint branching in directed multigraphs
- Solution of two fractional packing problems of Lovász
- Packing cycles in graphs
- Packing cycles in graphs. II
- Matchings and covers in hypergraphs
- On totally dual integral systems
- A faster algorithm for finding edge-disjoint branchings
- Minimum k arborescences with bandwidth constraints
- Packing circuits in eulerian digraphs
- Complexity of some arc-partition problems for digraphs
- Smallest number of vertices in a 2-arc-strong digraph without good pairs
- Non-separating spanning trees and out-branchings in digraphs of independence number 2
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
- The \(b\)-branching problem in digraphs
- Packing branchings under cardinality constraints on their root sets
- Edge-disjoint branchings in temporal digraphs
- Recent techniques and results on the Erdős-Pósa property
- (Arc-)disjoint flows in networks
- Solution of two fractional packing problems of Lovász. (Reprint)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties
- Note on a min-max conjecture of Woodall
- Covering intersecting bi-set families under matroid constraints
- Edmonds' branching theorem in digraphs without forward-infinite paths
- The complexity of finding arc-disjoint branching flows
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Intersection properties of maximal directed cuts in digraphs
- Polyhedra related to a lattice
- Arc-disjoint spanning sub(di)graphs in digraphs
- Projections, entropy and sumsets
- A faster algorithm for packing branchings in digraphs
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Edge-Disjoint Branchings in Temporal Graphs
- Representing non-crossing cuts by phylogenetic trees
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- Independent spanning trees with small depths in iterated line digraphs
- Anti-forcing numbers of perfect matchings of graphs
- Integral packing of branchings in capacitaded digraphs
- On the infinite Lucchesi–Younger conjecture I
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
- Good acyclic orientations of 4‐regular 4‐connected graphs
- On an f-coloring generalization of linear arboricity of multigraphs
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
- Arc-disjoint out- and in-branchings in compositions of digraphs
- Submodular functions in graph theory
- Approximate cut \& packing ratios for multi-commodity arborescences
- An algorithm for optimum common root functions of two digraphs
- Augmenting a hypergraph to have a matroid-based (f, g)-bounded (, )-limited packing of rooted hypertrees
- On some algorithmic and structural results on flames
- Regular packing of rooted hyperforests with root constraints in hypergraphs
- Dyadic linear programming and extensions
- Reconfiguration of the union of arborescences
- Reconfiguration of the union of arborescences
- How to see the forest despite the trees
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors
- Packing and covering of crossing families of cuts
- A family of perfect graphs associated with directed graphs
- An algorithm for minimum cost arc-connectivity orientations
- Partitioning series-parallel multigraphs into v^*-excluding edge covers
- Galois geometries and coding theory
- Restricted covering of digraphs with arborescences
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
This page was built for publication: On two minimax theorems in graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229885)
