Pages that link to "Item:Q1813713"
From MaRDI portal
The following pages link to Transversal numbers of uniform hypergraphs (Q1813713):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Minimum size transversals in uniform hypergraphs (Q394227) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Transversals and matchings in 3-uniform hypergraphs (Q691579) (← links)
- Transversals in 4-uniform hypergraphs (Q727047) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- Domination, radius, and minimum degree (Q967345) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- What must be contained in every oriented k-uniform hypergraph (Q1092925) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- Small transversals in hypergraphs (Q1193529) (← links)
- Signed domination in regular graphs and set-systems (Q1306310) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- On upper transversals in 3-uniform hypergraphs (Q1627202) (← links)
- Domination in intersecting hypergraphs (Q1627856) (← links)
- Multiple domination models for placement of electric vehicle charging stations in road networks (Q1652655) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Graphs with forbidden subgraphs and leaf number (Q1715759) (← links)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
- Transversals in uniform hypergraphs with property (7, 2) (Q1817581) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- Transversals in uniform hypergraphs with property \((p,2)\) (Q1848148) (← links)
- The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
- Small transversals in uniform hypergraphs (Q1920046) (← links)
- On point covers of multiple intervals and axis-parallel rectangles (Q1924491) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- Hypergraphs with large transversal number (Q1946666) (← links)
- A note on fractional disjoint transversals in hypergraphs (Q2012518) (← links)
- A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
- Affine planes and transversals in 3-uniform linear hypergraphs (Q2045381) (← links)
- Improved bounds on a generalization of Tuza's conjecture (Q2094882) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size (Q2111206) (← links)
