Pages that link to "Item:Q5611639"
From MaRDI portal
The following pages link to A generalization of Kónig's theorem (Q5611639):
Displaying 17 items.
- 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)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- On k-transversals (Q1106212) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- Spanning tree with lower bound on the degrees (Q1744244) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- List Coloring of Two Matroids through Reduction to Partition Matroids (Q5157385) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
