Transversal coalitions in hypergraphs
From MaRDI portal
Publication:6646394
DOI10.1016/J.DISC.2024.114267MaRDI QIDQ6646394
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transversals and domination in uniform hypergraphs
- The number of transversals in a Latin square
- Total domination of graphs and small transversals of hypergraphs
- Small transversals in hypergraphs
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
- Transversals in linear uniform hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- Transversals and independence in linear hypergraphs with maximum degree two
- Upper transversals in hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- An average degree condition for independent transversals
- Thresholds for the monochromatic clique transversal game
- On the coalition number of trees
- Total Domination in Graphs
- Introduction to coalitions in graphs
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Singleton coalition graph chains
- Transversals in regular uniform hypergraphs
- The Tuza–Vestergaard Theorem
- Transversals in hypergraphs through a new combinatorial game
- A characterization of graphs with given total coalition numbers
- Independent coalition in graphs: existence and characterization
This page was built for publication: Transversal coalitions in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646394)
