The following pages link to Secure domination in cographs (Q2416434):
Displaying 17 items.
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- The secure domination problem in cographs (Q1730021) (← links)
- Secure domination in rooted product graphs (Q2025078) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Restrained and total restrained domination in cographs (Q2151385) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- A note on secure domination in \(C_5\)-free graphs (Q2700614) (← links)
- Co-secure and secure domination in graphs (Q2878212) (← links)
- (Q6145882) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- On the complexity of co-secure dominating set problem (Q6195337) (← links)
- Secure total domination number in maximal outerplanar graphs (Q6546418) (← links)
- A lower bound for secure domination number of an outerplanar graph (Q6611009) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
