Pages that link to "Item:Q3605155"
From MaRDI portal
The following pages link to Hypergraphs with large transversal number and with edge sizes at least 3 (Q3605155):
Displaying 10 items.
- TOTAL DOMINATION POLYNOMIALS OF SOME SPLITTING GRAPHS (Q4639462) (← links)
- Bounds on the domination number of a digraph and its reverse (Q5024936) (← links)
- Matching criticality in intersecting hypergraphs (Q5236049) (← links)
- Total Transversals in Hypergraphs and Their Applications (Q5251541) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- On improved upper bounds on the transversal number of hypergraphs (Q5883642) (← links)
- Semitotal domination in claw-free cubic graphs (Q5892260) (← links)
- Transversals in regular uniform hypergraphs (Q6144921) (← links)
- The Tuza–Vestergaard Theorem (Q6161262) (← links)
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs (Q6606247) (← links)