How long can a graph be kept planar?
type: Item
instance of: scholarly article
title: How long can a graph be kept planar?
zbMATH Open document ID: 1159.91007
author: V. Anuradha
author: Chinmay Jain
author: Tibor Szabó
author: Jack Snoeyink
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/129797
full work available at URL: v15i1n14.html
review text: Summary: 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\sqrt n\).
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 5540876
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5540876