Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
From MaRDI portal
Publication:6606247
DOI10.1007/978-3-031-49614-1_27MaRDI QIDQ6606247
Publication date: 16 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraphs with large domination number and with edge sizes at least three
- Matchings and transversals in hypergraphs, domination and independence in trees
- Transversals and domination in uniform hypergraphs
- On the domination of hypergraphs by their edges
- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- Domination game on uniform hypergraphs
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Domination in hypergraphs
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
This page was built for publication: Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606247)
