Record Details

How long can a graph he kept planar?

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title How long can a graph he kept planar?
 
Creator ANURADHA, V
JAIN, C
SNOEYINK, J
SZABO, T
 
Subject games
 
Description 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.
 
Publisher ELECTRONIC JOURNAL OF COMBINATORICS
 
Date 2011-07-21T15:17:37Z
2011-12-26T12:52:03Z
2011-12-27T05:39:00Z
2011-07-21T15:17:37Z
2011-12-26T12:52:03Z
2011-12-27T05:39:00Z
2008
 
Type Article
 
Identifier ELECTRONIC JOURNAL OF COMBINATORICS, 15(1), -
1077-8926
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5905
http://hdl.handle.net/10054/5905
 
Language en