Sciweavers

COMGEO
2011
ACM
13 years 5 months ago
A computational approach to Conway's thrackle conjecture
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
Radoslav Fulek, János Pach
CCCG
2006
14 years 9 days ago
A Study of Conway's Thrackle Conjecture
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at whi...
Wei Li 0011, Karen Daniels, Konstantin A. Rybnikov
COMPGEOM
1995
ACM
14 years 2 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...