2-Matchings and 2-covers of hypergraphs
From MaRDI portal
Publication:4106238
DOI10.1007/BF01902352zbMath0339.05123MaRDI QIDQ4106238
Publication date: 1975
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
Families of cuts with the MFMC-property ⋮ Conservative weightings and ear-decompositions of graphs ⋮ On Dyadic Fractional Packings of $T$-Joins ⋮ On the integral 4-packing of \(T\)-cuts ⋮ Undirected distances and the postman-structure of graphs ⋮ The Schrijver system of odd join polyhedra ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Fractional matchings and covers in infinite hypergraphs ⋮ Polyhedra related to undirected multicommodity flows ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Packing cycles exactly in polynomial time ⋮ Projections, entropy and sumsets ⋮ On a min--max theorem on bipartite graphs ⋮ The ellipsoid method and its consequences in combinatorial optimization ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus ⋮ Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems ⋮ Optimal fractional matchings and covers in infinite hypergraphs: existence and duality ⋮ An Excluded Minor Characterization of Seymour Graphs ⋮ Tight integral duality gap in the Chinese postman problem ⋮ Finding thet-join structure of graphs ⋮ On shortest \(T\)-joins and packing \(T\)-cuts ⋮ Solution of two fractional packing problems of Lovász. (Reprint) ⋮ A minimax theorem on circuits in projective graphs ⋮ Solution of two fractional packing problems of Lovász ⋮ On the number of copies of one hypergraph in another ⋮ Matchings and covers in hypergraphs ⋮ An Approximation Algorithm for Fully Planar Edge-Disjoint Paths ⋮ LP duality in infinite hypergraphs ⋮ Combinatorics of orientation reversing polygons
Cites Work
