Pages that link to "Item:Q1060966"
From MaRDI portal
The following pages link to Finding minimum dominating cycles in permutation graphs (Q1060966):
Displayed 8 items.
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
