Total domination of graphs and small transversals of hypergraphs
From MaRDI portal
Recommendations
- Transversals and domination in uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
- Total transversals in hypergraphs and their applications
- scientific article; zbMATH DE number 7666858
Cites work
- scientific article; zbMATH DE number 1462928 (Why is no real title available?)
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fractional dominations and fractional total dominations of graph complements
- ON THE TWO-COLOURING OF HYPERGRAPHS
- On the total domination number of graphs
- Small transversals in hypergraphs
- Some remarks on domination
- Transversal numbers of uniform hypergraphs
Cited in
(73)- Relating the total domination number and the annihilation number of cactus graphs and block graphs
- Linear hypergraphs with large transversal number and maximum degree two
- Total domination in partitioned graphs
- Total domination in planar graphs of diameter two
- Total dominating sequences in graphs
- My favorite domination conjectures in graph theory are bounded
- Transversals and independence in linear hypergraphs with maximum degree two
- A new lower bound on the independence number of a graph and applications
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
- Asymptotic bounds on total domination in regular graphs
- Transversals in regular uniform hypergraphs
- On a conjecture on total domination in claw-free cubic graphs
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large domination number and with edge sizes at least three
- Bounds on the domination number of a digraph and its reverse
- Total domination in graphs with given girth
- Upper transversals in hypergraphs
- A linear Vizing‐like relation relating the size and total domination number of a graph
- Simultaneous graph parameters: factor domination and factor total domination
- Transversals and domination in uniform hypergraphs
- Total domination in graphs with diameter 2
- On -total domination in graphs
- A survey of selected recent results on total domination in graphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- Sharp concentration of hitting size for random set systems
- On 2-colorings of hypergraphs
- On the transversal number of \(k\)-uniform connected hypergraphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- A note on improved upper bounds on the transversal number of hypergraphs
- An upper bound for the transversal number of connected \(k\)-uniform hypergraphs
- Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
- Fractional domatic, idomatic, and total domatic numbers of a graph
- The annihilation number and the total domination number of a tree-like graph
- A note on fractional disjoint transversals in hypergraphs
- Total domination stable graphs upon edge addition
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- The Tuza–Vestergaard Theorem
- Strong transversals in hypergraphs and double total domination in graphs
- Transversals in 6-uniform hypergraphs and total domination in graphs with minimum degree six
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- Domination and total domination in hypergraphs
- Minimum \(k\)-path vertex cover
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- A new upper bound on the total domination number in graphs with minimum degree six
- Affine planes and transversals in 3-uniform linear hypergraphs
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
- An improved upper bound on the total restrained domination number in cubic graphs
- Independence in 5-uniform hypergraphs
- Bounds on domination parameters in graphs: a brief survey
- On the transversal number of rank \(k\) hypergraphs
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
- Total domination in regular graphs
- Nordhaus-Gaddum bounds for total domination
- Transversal coalitions in hypergraphs
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
- On Turán numbers of the complete 4-graphs
- Enumeration of minimal dominating sets and variants
- On matching and total domination in graphs
- Relating the annihilation number and the total domination number for some graphs
- Transversals in 4-uniform hypergraphs
- Dominating and total dominating partitions in cubic graphs
- Perfect matchings in total domination critical graphs
- Total transversals in hypergraphs and their applications
- On the ratio between 2-domination and total outer-independent domination numbers of trees
- Essential upper bounds on the total domination number
- Properties of total domination edge-critical graphs
- Connected domination
- Bounds on upper transversals in hypergraphs
- Multiple domination
This page was built for publication: Total domination of graphs and small transversals of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949753)
