The following pages link to Domination in Kneser graphs (Q5287908):
Displaying 9 items.
- The domination complexity and related extremal values of large 3D torus (Q1791110) (← links)
- Efficient domination in knights graphs (Q2370394) (← links)
- \((k,r)\)-domination in graphs (Q2908008) (← links)
- Bounds on the domination number of Kneser graphs (Q3465656) (← links)
- (Q4386089) (← links)
- The smallest order of a graph with domination number equal to two and with every vertex contained in a \(K_n\) (Q4873689) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- Total dominator chromatic number of Kneser graphs (Q6166235) (← links)