Elimination properties for minimal dominating sets of graphs
From MaRDI portal
Publication:2107746
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
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A note on disjoint dominating sets in graphs
- Determining sets, resolving sets, and the exchange property
- Flips in planar graphs
- On the enumeration of minimal dominating sets and related notions
- Remarks about disjoint dominating sets
- Uniform clutters and dominating sets of graphs
Cited in
(4)
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)