Pages that link to "Item:Q5202214"
From MaRDI portal
The following pages link to On the Fractional Covering Number of Hypergraphs (Q5202214):
Displaying 13 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Covering the complete graph by partitions (Q916671) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Universal maximal packing functions of graphs (Q1126177) (← links)
- Indecomposable regular graphs and hypergraphs (Q1197014) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Maximal irredundant functions (Q1923617) (← links)
- Sequential legislative lobbying (Q2450085) (← links)
- (Q5089208) (← links)
- Fractional covers of hypergraphs with bounded multi-intersection (Q6057846) (← links)
