Pages that link to "Item:Q3859781"
From MaRDI portal
The following pages link to Packing Problems and Hypergraph Theory: A Survey (Q3859781):
Displaying 10 items.
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Maximum degree and fractional matchings in uniform hypergraphs (Q1168988) (← links)
- A recognition problem in converting linear programming to network flow models (Q1309143) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
