On two minimax theorems in graph
From MaRDI portal
Publication:1229885
DOI10.1016/0095-8956(76)90049-6zbMath0337.05115OpenAlexW2073834089MaRDI QIDQ1229885
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90049-6
Related Items
Polyhedral proof methods in combinatorial optimization, Minimum \(k\) arborescences with bandwidth constraints, Edge-Disjoint Branchings in Temporal Graphs, A quick proof of Seymour's theorem on t-joins, The complexity of finding arc-disjoint branching flows, Stronger bounds and faster algorithms for packing in generalized kernel systems, An algorithm for minimum cost arc-connectivity orientations, Representing non-crossing cuts by phylogenetic trees, Directed cut transversal packing for source-sink connected graphs, The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings, Intersection properties of maximal directed cuts in digraphs, Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers, Edge-disjoint in- and out-branchings in tournaments and related path problems, Recent techniques and results on the Erdős-Pósa property, Packing circuits in eulerian 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, The \(b\)-branching problem in digraphs, On the orientation of graphs, The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties, Packing cycles in graphs, Packing cycles in graphs. II, On an \(f\)-coloring generalization of linear arboricity of multigraphs, 2-linked graphs, Unnamed Item, Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs, Galois geometries and coding theory, Arc-disjoint spanning sub(di)graphs in digraphs, (Arc-)disjoint flows in networks, Restricted covering of digraphs with arborescences, Projections, entropy and sumsets, How to make a digraph strongly connected, Packing branchings under cardinality constraints on their root sets, A faster algorithm for packing branchings in digraphs, Edge-disjoint branchings in temporal digraphs, Note on a min-max conjecture of Woodall, Submodular functions in graph theory, An algorithm for optimum common root functions of two digraphs, Independent spanning trees with small depths in iterated line digraphs, Solution of two fractional packing problems of Lovász. (Reprint), A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph, Anti-forcing numbers of perfect matchings of graphs, Integral packing of branchings in capacitaded digraphs, Packing in generalized kernel systems: a framework that generalizes packing of branchings, Edge-disjoint branching in directed multigraphs, Solution of two fractional packing problems of Lovász, Packing circuits in matroids, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Matchings and covers in hypergraphs, Covering Intersecting Bi-set Families under Matroid Constraints, Rooted \(k\)-connections in digraphs, A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors, Polyhedra related to a lattice, On totally dual integral systems, Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, An Approximation Algorithm for Fully Planar Edge-Disjoint Paths, Complexity of some arc-partition problems for digraphs, A faster algorithm for finding edge-disjoint branchings, Smallest number of vertices in a 2-arc-strong digraph without good pairs, Packing and covering of crossing families of cuts, A family of perfect graphs associated with directed graphs, Non-separating spanning trees and out-branchings in digraphs of independence number 2
Cites Work
