Pages that link to "Item:Q5057448"
From MaRDI portal
The following pages link to Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448):
Displaying 7 items.
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- (Q5071562) (← links)
- On the structure of graphs with bounded asteroidal number (Q5943049) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)