Pages that link to "Item:Q1167535"
From MaRDI portal
The following pages link to Complexity of finding k-path-free dominating sets in graphs (Q1167535):
Displaying 3 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
