Pages that link to "Item:Q2891369"
From MaRDI portal
The following pages link to Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369):
Displaying 12 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Elimination properties for minimal dominating sets of graphs (Q2107746) (← links)
- Maximum number of minimum dominating and minimum total dominating sets (Q2878219) (← links)
- (Q3171844) (← links)
- (Q3426068) (← links)
- On maximum number of minimal dominating sets in graphs (Q3439327) (← links)
- On the minimum vertex covering transversal dominating sets in graphs and their classification (Q4595258) (← links)
- Combinatorial bounds via measure and conquer (Q4962767) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)