Geometry and Generation of a New Graph Planarity Game

DOI10.7155/jgaa.00504zbMath1419.05139arXiv1908.01426OpenAlexW2972582358MaRDI QIDQ5233138

André van Renssen, Wouter Meulemans, Rutger Kraaijer, Marc J. van Kreveld

Publication date: 16 September 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.01426

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Untangling circular drawings: algorithms and complexity

Uses Software

• NetLogo

Cites Work

• Unnamed Item
• Unnamed Item
• Bold graph drawings
• Semispaces of configurations, cell complexes of arrangements
• How to draw a planar graph on a grid
• On the obfuscation complexity of planar graphs
• A polynomial bound for untangling geometric planar graphs
• Untangling a planar graph
• A linear algorithm for embedding planar graphs using PQ-trees
• On embedding an outer-planar graph in a point set
• Enumerating order types for small point sets with applications
• Swapping labeled tokens on graphs
• On the number of plane geometric graphs
• Every Graph Admits an Unambiguous Bold Drawing
• Minimum-weight triangulation is NP-hard
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

This page was built for publication: Geometry and Generation of a New Graph Planarity Game