Skip to search formSkip to main contentSkip to account menu

Thrackle

Known as: Conway's thrackle conjecture 
A thrackle is an embedding of a graph in the plane, such that each edge is a Jordan arcand every pair of edges meet once. Edges may either meet at a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a… 
2012
2012
We study some variants of Conway's thrackle conjecture. A tangle is a graph drawn in the plane such that its edges are… 
2012
2012
This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle… 
2006
2006
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… 
2006
2006
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… 
2004
2004
We prove the thrackle conjecture for K5 and K3,3. To do this we reduce the problem to a set of simultaneous quadratic equations…