Matchings and transversals in hypergraphs, domination and independence in trees
From MaRDI portal
Publication:599067
DOI10.1016/0095-8956(79)90044-3zbMath0414.05036OpenAlexW2052665169MaRDI QIDQ599067
E. J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90044-3
Related Items (15)
Transversals and independence in linear hypergraphs with maximum degree two ⋮ Obstructions for partitioning into forests and outerplanar graphs ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Matchings, path covers and domination ⋮ A new lower bound on the independence number of a graph and applications ⋮ Extremal hypergraphs for matching number and domination number ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ On matching and semitotal domination in graphs ⋮ Locational analysis ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ Matching criticality in intersecting hypergraphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: Matchings and transversals in hypergraphs, domination and independence in trees
