Pages that link to "Item:Q2184661"
From MaRDI portal
The following pages link to Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661):
Displaying 5 items.
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- (Q3462806) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)