How long can a graph he kept planar?
| Autor: | ANURADHA, V, JAIN, C, SNOEYINK, J, SZABO, T |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2008 |
| Předmět: | |
| Zdroj: | IndraStra Global. |
| ISSN: | 2381-3652 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|