Pages that link to "Item:Q2377237"
From MaRDI portal
The following pages link to Trees having many minimal dominating sets (Q2377237):
Displaying 17 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Minimal nonstandard Coxeter trees (Q1312864) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Graphs with few total dominating sets (Q1699541) (← links)
- On the maximum number of minimum dominating sets in forests (Q1727765) (← links)
- Trees with minimum number of infima closed sets (Q2113344) (← links)
- Trees with extremal numbers of \(k\)-dominating sets (Q2237230) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Trees with minimum F-coindex (Q2413376) (← links)
- On the number of minimum dominating sets in trees (Q2699794) (← links)
- Minimal Double Dominating Sets in Trees (Q3188844) (← links)
- Domination cover number of graphs (Q4634292) (← links)
- Linear-time algorithm for generating c-isolated bicliques (Q4976342) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- (Q5463506) (← links)