Geodesic
How long can a graph be kept planar?
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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$.
DOI : 10.37236/889
Classification : 91A24 
V. Anuradha; Chinmay Jain; Jack Snoeyink; Tibor Szabó. How long can a graph be kept planar?. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/889
@article{10_37236_889,
     author = {V. Anuradha and Chinmay Jain and Jack Snoeyink and Tibor Szab\'o},
     title = {How long can a graph be kept planar?},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/889},
     zbl = {1159.91007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/889/}
}
TY  - JOUR
AU  - V. Anuradha
AU  - Chinmay Jain
AU  - Jack Snoeyink
AU  - Tibor Szabó
TI  - How long can a graph be kept planar?
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/889/
DO  - 10.37236/889
ID  - 10_37236_889
ER  - 
%0 Journal Article
%A V. Anuradha
%A Chinmay Jain
%A Jack Snoeyink
%A Tibor Szabó
%T How long can a graph be kept planar?
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/889/
%R 10.37236/889
%F 10_37236_889

Cité par Sources :