Transversal numbers of uniform hypergraphs
From MaRDI portal
Publication:1813713
DOI10.1007/BF01787474zbMath0742.05065MaRDI QIDQ1813713
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items
Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Domination in intersecting hypergraphs ⋮ A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Multiple domination models for placement of electric vehicle charging stations in road networks ⋮ Lower bounds on the number of leaves in spanning trees ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Domination number of graphs with minimum degree five ⋮ Rainbow edge-coloring and rainbow domination ⋮ Bounds of the number of leaves of spanning trees in graphs without triangles ⋮ Bounds of the number of leaves of spanning trees ⋮ Minimum size transversals in uniform hypergraphs ⋮ Total transversals and total domination in uniform hypergraphs ⋮ Spanning trees with few non-leaves ⋮ Upper transversals in hypergraphs ⋮ Connected domination in random graphs ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Minimum Degree and Dominating Paths ⋮ Extremal hypergraphs for matching number and domination number ⋮ 2-connected graphs with small 2-connected dominating sets. ⋮ Transversals in regular uniform hypergraphs ⋮ Directed domination in oriented graphs ⋮ A note on the Tuza constant \(c_k\) for small \(k\) ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ Unnamed Item ⋮ Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs ⋮ Graphs with forbidden subgraphs and leaf number ⋮ Transversals and domination in uniform hypergraphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ Covering all cliques of a graph ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Spanning trees: A survey ⋮ On roman, global and restrained domination in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Domination game on uniform hypergraphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Total domination of graphs and small transversals of hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Constructing a spanning tree with many leaves ⋮ Domination, radius, and minimum degree ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ Minimum \(k\)-path vertex cover ⋮ Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ A survey of selected recent results on total domination in graphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Domination and matching in power and generalized power 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 ⋮ Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 ⋮ Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 ⋮ Spanning trees with many leaves ⋮ Domination and Total Domination in Hypergraphs ⋮ Multiple Domination ⋮ Fractional Dominating Parameters ⋮ Unnamed Item ⋮ Connected domination of regular graphs ⋮ Matching criticality in intersecting hypergraphs ⋮ Lower bounds on the leaf number in graphs with forbidden subgraphs ⋮ Bounds for optimal coverings ⋮ Unnamed Item ⋮ Fractional domination game ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ Signed domination in regular graphs and set-systems ⋮ A note on connected domination number and leaf number ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ Sharp concentration of hitting size for random set systems ⋮ On general frameworks and threshold functions for multiple domination ⋮ On coupon colorings of graphs ⋮ Algorithms and almost tight results for 3-colorability of small diameter graphs
Cites Work
