Pages that link to "Item:Q4106238"
From MaRDI portal
The following pages link to 2-Matchings and 2-covers of hypergraphs (Q4106238):
Displaying 30 items.
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Projections, entropy and sumsets (Q452821) (← links)
- 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 (Q484552) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Combinatorics of orientation reversing polygons (Q1075334) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Fractional matchings and covers in infinite hypergraphs (Q1115456) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464) (← links)
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality (Q1187944) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- A minimax theorem on circuits in projective graphs (Q1255022) (← links)
- Solution of two fractional packing problems of Lovász (Q1260046) (← links)
- On the number of copies of one hypergraph in another (Q1264288) (← links)
- On a min--max theorem on bipartite graphs (Q1422438) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- On Dyadic Fractional Packings of $T$-Joins (Q5043644) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
