Pages that link to "Item:Q1693127"
From MaRDI portal
The following pages link to On the secure domination numbers of maximal outerplanar graphs (Q1693127):
Displaying 12 items.
- An improved binary programming formulation for the secure domination problem (Q828823) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- Domination and outer connected domination in maximal outerplanar graphs (Q2053729) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Double domination in maximal outerplanar graphs (Q2084232) (← links)
- Bounds for the connected domination number of maximal outerplanar graphs (Q2166232) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Secure domination in cographs (Q2416434) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)