Hypergraphs with large transversal number and with edge sizes at least 3
From MaRDI portal
Publication:3605155
DOI10.1002/JGT.20340zbMATH Open1211.05091OpenAlexW4244532441MaRDI QIDQ3605155FDOQ3605155
Authors: Michael A. Henning, A. Yeo 
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20340
Recommendations
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large transversal number
- Hypergraphs with large domination number and with edge sizes at least three
- The largest transversal numbers of uniform hypergraphs
- Hypergraph families with bounded edge cover or transversal number
- Linear hypergraphs with large transversal number and maximum degree two
- scientific article; zbMATH DE number 7666858
- Large vertex-transitive and Cayley graphs with given degree and diameter
- Total transversals in hypergraphs and their applications
- On the number of minimal transversals in 3-uniform hypergraphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
Cited In (61)
- My favorite domination conjectures in graph theory are bounded
- Transversals in regular uniform hypergraphs
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
- Fractional domatic, idomatic, and total domatic numbers of a graph
- Total domination in partitioned graphs
- Total domination in planar graphs of diameter two
- Transversals and independence in linear hypergraphs with maximum degree two
- A new lower bound on the independence number of a graph and applications
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- A characterization of hypergraphs with large domination number
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- Bounds on the domination number of a digraph and its reverse
- 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
- Total domination in graphs with diameter 2
- Bounds on total domination in claw-free cubic graphs
- Transversals and domination in uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- On \(\alpha\)-total domination in graphs
- A survey of selected recent results on total domination in graphs
- On 2-colorings of hypergraphs
- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Total domination versus domination in cubic graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- A note on improved upper bounds on the transversal number of hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- A note on fractional disjoint transversals in hypergraphs
- The Tuza–Vestergaard Theorem
- Total domination stable graphs upon edge addition
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- Strong transversals in hypergraphs and double total domination in graphs
- Locating-total domination in claw-free cubic graphs
- Title not available (Why is that?)
- Domination and total domination in hypergraphs
- Matchings, path covers and domination
- A new upper bound on the total domination number in graphs with minimum degree six
- On (1,2)-domination in cubic graphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- Total transversals and total domination in uniform hypergraphs
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
- Semitotal domination in claw-free cubic graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- Bounds on domination parameters in graphs: a brief survey
- Nordhaus-Gaddum bounds for total domination
- Matching criticality in intersecting hypergraphs
- Domination and matching in power and generalized power hypergraphs
- Total domination polynomials of some splitting graphs
- Total transversals in hypergraphs and their applications
- Transversals in 4-uniform hypergraphs
- Hypergraphs with large transversal number
- Dominating and total dominating partitions in cubic graphs
- Perfect matchings in total domination critical graphs
- (Total) domination in prisms
- Essential upper bounds on the total domination number
- Multiple domination
- Linear hypergraphs with large transversal number and maximum degree two
This page was built for publication: Hypergraphs with large transversal number and with edge sizes at least 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605155)
