Pages that link to "Item:Q5251541"
From MaRDI portal
The following pages link to Total Transversals in Hypergraphs and Their Applications (Q5251541):
Displaying 15 items.
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions (Q1333159) (← links)
- Hypergraphs with large transversal number (Q1946666) (← links)
- Bounds on upper transversals in hypergraphs (Q2292129) (← links)
- Faster Algorithms to Enumerate Hypergraph Transversals (Q2802949) (← links)
- Domination and Total Domination in Hypergraphs (Q3384117) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Hypergraphs with large transversal number and with edge sizes at least 3 (Q3605155) (← links)
- (Q5260294) (← links)
- A Lower Bound for the HBC Transversal Hypergraph Generation (Q5416742) (← links)
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs (Q5456571) (← links)
- Computing and Combinatorics (Q5716999) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918592) (← links)