Pages that link to "Item:Q3605155"
From MaRDI portal
The following pages link to Hypergraphs with large transversal number and with edge sizes at least 3 (Q3605155):
Displaying 50 items.
- A characterization of hypergraphs with large domination number (Q274700) (← links)
- Matchings, path covers and domination (Q329554) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- On \(\alpha\)-total domination in graphs (Q423927) (← links)
- Hypergraphs with large transversal number and with edge sizes at least four (Q424115) (← links)
- Hypergraphs with large domination number and with edge sizes at least three (Q444441) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Total domination stable graphs upon edge addition (Q607001) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- On a conjecture on total domination in claw-free cubic graphs (Q710600) (← links)
- Transversals in 4-uniform hypergraphs (Q727047) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Bounds on total domination in claw-free cubic graphs (Q932674) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- Total domination in planar graphs of diameter two (Q1045014) (← links)
- Domination in intersecting hypergraphs (Q1627856) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Total domination versus domination in cubic graphs (Q1706439) (← links)
- Essential upper bounds on the total domination number (Q1752594) (← links)
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
- An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
- Hypergraphs with large transversal number (Q1946666) (← links)
- A note on fractional disjoint transversals in hypergraphs (Q2012518) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
- On (1,2)-domination in cubic graphs (Q2043407) (← links)
- Affine planes and transversals in 3-uniform linear hypergraphs (Q2045381) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs (Q2231740) (← links)
- Domination and matching in power and generalized power hypergraphs (Q2292152) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (Q2439129) (← links)
- Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3 (Q2825489) (← links)
- Total domination in graphs with diameter 2 (Q2874092) (← links)
- On 2-Colorings of Hypergraphs (Q2947946) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph (Q3384110) (← links)
- Domination and Total Domination in Hypergraphs (Q3384117) (← links)
- Multiple Domination (Q3384609) (← links)
- A note on improved upper bounds on the transversal number of hypergraphs (Q4621301) (← links)
