Pages that link to "Item:Q5060107"
From MaRDI portal
The following pages link to Connected domination and steiner set on asteroidal triple-free graphs (Q5060107):
Displaying 8 items.
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)