Name
Abstract | ||
|---|---|---|
The graph (non-)planarity game is played on the complete graph K-n between an Enforcer and an Avoider, each of whom take one edge per round. The game ends when the edges chosen by Avoider form a non-planar subgraph. We show that Avoider can play for 3n - 26 turns, improving the previous bound of 3n - 28 root n. |
Year | Venue | Keywords |
|---|---|---|
2008 | ELECTRONIC JOURNAL OF COMBINATORICS | games |
DocType | Volume | Issue |
Journal | 15 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 2 | 0.43 |
References | Authors | |
5 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Anuradha | 1 | 2 | 0.43 |
| Chinmay Jain | 2 | 4 | 1.13 |
| Jack Snoeyink | 3 | 2842 | 231.68 |
| UNC Chapel Hill | 4 | 4 | 1.22 |
| Tibor Szab | 5 | 2 | 0.43 |
| ETH Zurich | 6 | 322 | 22.30 |
| ETH Zurich | 7 | 322 | 22.30 |