Elimination properties for minimal dominating sets of graphs
DOI10.7151/DMGT.2354zbMATH Open1504.05221OpenAlexW3085979741MaRDI QIDQ2107746FDOQ2107746
Authors: Jaume Martí-Farré, Mercè Mora, M. L. Puertas, 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
Recommendations
- Publication:4865138
- scientific article; zbMATH DE number 1416465
- Minimal elimination ordering for graphs of bounded degree
- On minus domination in graphs
- MINIMUM DOMINATING SETS WITH MINIMUM STATUS IN GRAPHS
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal elimination of planar graphs
- Minus domination in graphs
- scientific article; zbMATH DE number 850313
Extremal problems in graph theory (05C35) 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining sets, resolving sets, and the exchange property
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Title not available (Why is that?)
- Remarks about disjoint dominating sets
- A note on disjoint dominating sets in graphs
- Flips in planar graphs
- Uniform clutters and dominating sets of graphs
Cited In (3)
This page was built for publication: Elimination properties for minimal dominating sets of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107746)