Pages that link to "Item:Q2260635"
From MaRDI portal
The following pages link to Keeping avoider's graph almost acyclic (Q2260635):
Displaying 5 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- On the separation conjecture in avoider-enforcer games (Q2312614) (← links)
- Avoidance couplings on non‐complete graphs (Q6074647) (← links)