Elimination properties for minimal dominating sets of graphs
From MaRDI portal
Publication:2107746
DOI10.7151/dmgt.2354zbMath1504.05221OpenAlexW3085979741MaRDI QIDQ2107746
María Luz Puertas, Mercè Mora, Jaume Martí-Farré, José Luis Ruiz
Publication date: 2 December 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2354
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flips in planar graphs
- Determining sets, resolving sets, and the exchange property
- Remarks about disjoint dominating sets
- Uniform clutters and dominating sets of graphs
- On the Enumeration of Minimal Dominating Sets and Related Notions
This page was built for publication: Elimination properties for minimal dominating sets of graphs