Domination and matching in power and generalized power hypergraphs
DOI10.1007/S10878-019-00481-3zbMATH Open1434.05101OpenAlexW2988775211WikidataQ126777243 ScholiaQ126777243MaRDI QIDQ2292152FDOQ2292152
Authors: Yanxia Dong, Moo Young Sohn, Zuosong Liang 
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00481-3
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small transversals in hypergraphs
- Transversal numbers of uniform hypergraphs
- A characterization of graphs with equal domination number and vertex cover number
- Total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Domination in hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large domination number and with edge sizes at least three
- Transversals and domination in uniform hypergraphs
- Ryser's conjecture for tripartite 3-graphs
- Matchings and covers in hypergraphs
- Equality of domination and transversal numbers in hypergraphs
- Title not available (Why is that?)
- Linear hypergraphs with large transversal number and maximum degree two
- Transversals and matchings in 3-uniform hypergraphs
- On Ryser's conjecture
- Characterization of graphs with equal domination and covering number
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on a conjecture of Ryser
- Upper bound for transversals of tripartite hypergraphs
- Star-uniform graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- Matching and domination numbers in \(r\)-uniform hypergraphs
Cited In (6)
- Domination in intersecting hypergraphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Relations among some parameters of hypergraphs
- An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs
- Equality of domination and transversal numbers in hypergraphs
- On \(H\)-dominating matchings and some number partitions
This page was built for publication: Domination and matching in power and generalized power hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292152)
