A New Family of k-in-a-Row Games
Lecture notes in computer science2006pp. 180–194
Citations Over TimeTop 14% of 2006 papers
Related Papers
- → Independent transversals in bipartite correspondence-covers(2021)9 cited
- → Lower bounds on the independence number of certain graphs of odd girth at least seven(2010)5 cited
- → Up-embeddability of graphs with small order(2009)1 cited
- Strictly Training Medical Workers of Excellent Style(2001)
- → Minimal Estrada index of the trees without perfect matchings(2019)