The following pages link to Small transversals in hypergraphs (Q1193529):
Displayed 14 items.
- Total domination stable graphs upon edge addition (Q607001) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- \(k\)-tuple total domination in graphs (Q708327) (← links)
- On a conjecture on total domination in claw-free cubic graphs (Q710600) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Total domination in graphs with given girth (Q1014823) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- Simultaneous graph parameters: factor domination and factor total domination (Q2509300) (← links)
- Hypergraphs with large transversal number and with edge sizes at least 3 (Q3605155) (← links)
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles (Q3605160) (← links)