The following pages link to Nacim Oijid (Q2672622):
Displaying 12 items.
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- The maker-maker domination game in forests (Q6124422) (← links)
- Bipartite instances of INFLUENCE (Q6199398) (← links)
- Incidence, a Scoring Positional Game on Graphs (Q6415914) (← links)
- Fast winning strategies for the attacker in eternal domination (Q6518097) (← links)
- The Maker-Breaker Largest Connected Subgraph Game (Q6522588) (← links)
- Poset Positional Games (Q6530170) (← links)
- Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles (Q6530760) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
- Avoidance games are PSPACE-complete (Q6615142) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
