Pages that link to "Item:Q599067"

The following pages link to Matchings and transversals in hypergraphs, domination and independence in trees (Q599067):

Displaying 14 items.

• The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
• Matchings, path covers and domination (Q329554) (← links)
• A new lower bound on the independence number of a graph and applications (Q405126) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
• Locational analysis (Q1173002) (← links)
• Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
• The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
• Lower bounds on Tuza constants for transversals in linear uniform hypergraphs (Q2231740) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• On matching and semitotal domination in graphs (Q2440939) (← links)
• The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
• Transversals in regular uniform hypergraphs (Q6144921) (← links)
• The Tuza–Vestergaard Theorem (Q6161262) (← links)