Pages that link to "Item:Q476916"
From MaRDI portal
The following pages link to On the number of minimal dominating sets on some graph classes (Q476916):
Displaying 12 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Combinatorial properties of Farey graphs (Q2333787) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)
