The following pages link to Small transversals in hypergraphs (Q1193529):
Displayed 35 items.
- Minimum size transversals in uniform hypergraphs (Q394227) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- On \(\alpha\)-total domination in graphs (Q423927) (← links)
- Hypergraphs with large transversal number and with edge sizes at least four (Q424115) (← links)
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- Total domination stable graphs upon edge addition (Q607001) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← 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)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← 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)
- An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (Q2439129) (← links)
- Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- Simultaneous graph parameters: factor domination and factor total domination (Q2509300) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← 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)
- The potential of greed for independence (Q4650180) (← links)