Domination, matching and transversal numbers for Berge-$G$ hypergraphs

María José Chávez de Diego, Pablo Montero Moreno, María Trinidad Villar-Liñán

Let $G=(V(G),E(G))$ be a graph and $H=(V(H),E(H))$ be a hypergraph. The hypergraph $H$ is a {\it Berge-G} if there is a bijection $f:E(G)\mapsto E(H)$ such that for each $e \in…