On the edge-vertex ratio of maximal thrackles

DOI10.1007/978-3-030-35802-0_37OpenAlexW2989896095MaRDI QIDQ2206880

Birgit Vogtenhuber, Felix Schröder, Boris Klemz, Linda Kleist, Oswin Aichholzer

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved enumeration of simple topological graphs
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
• A computational approach to Conway's thrackle conjecture
• Outerplanar thrackles
• Generalized thrackle drawings of non-bipartite graphs
• On Conway's thrackle conjecture
• Thrackles: an improved upper bound
• Bounds for generalized thrackles
• Saturated simple and \(k\)-simple topological graphs
• On the bounds of Conway's thrackles
• Great-circle spherical thrackles
• Conway’s Conjecture for Monotone Thrackles
• Annular and pants thrackles
• Saturated simple and 2-simple topological graphs with few edges
• Tangled Thrackles

This page was built for publication: On the edge-vertex ratio of maximal thrackles