Pages that link to "Item:Q1383679"
From MaRDI portal
The following pages link to Games without repetitions on graphs with vertex disjoint cycles (Q1383679):
Displaying 4 items.
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- Games without repetitions on trees and multitrees (Q1312356) (← links)
- Games without repetitions on digraphs (Q1325234) (← links)
- Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games (Q1744331) (← links)