Pages that link to "Item:Q1850010"
From MaRDI portal
The following pages link to Covering a hypergraph of subgraphs (Q1850010):
Displaying 18 items.
- Red-blue clique partitions and \((1-1)\)-transversals (Q311567) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
- Covering the edges of a graph by a prescribed tree with minimum overlap (Q1386432) (← links)
- The \((p, q)\) property in families of \(d\)-intervals and \(d\)-trees (Q1727783) (← links)
- A tree version of Kőnig's theorem (Q1872889) (← links)
- Piercing numbers in approval voting (Q2334834) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- KKM -- a topological approach for trees (Q2567406) (← links)
- Partial covering of hypergraphs (Q2921715) (← links)
- (Q3222235) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- (Q3739169) (← links)
- Using Brouwer’s Fixed Point Theorem (Q4604376) (← links)
- Quadratic forms on graphs (Q5896810) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
