Pages that link to "Item:Q1671314"
From MaRDI portal
The following pages link to Secure domination in proper interval graphs (Q1671314):
Displaying 14 items.
- The secure domination problem in cographs (Q1730021) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination (Q2025071) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Secure domination in cographs (Q2416434) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- A linear algorithm for double Roman domination of proper interval graphs (Q5216450) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- (Q6145882) (← links)
- (Q6150942) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)
