Pages that link to "Item:Q2462351"
From MaRDI portal
The following pages link to Node-searching problem on block graphs (Q2462351):
Displaying 6 items.
- Edge search number of cographs (Q415273) (← links)
- On computing a minimum secure dominating set in block graphs (Q1702842) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)