FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2017
02419922017

Related topics

Related topics

11 relations
Computational geometryConvex hullDegree (graph theory)Graph (discrete mathematics)
(More)

Broader (1)

Topological graph theory

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Thrackle
Graph (discrete mathematics)
Planar graph
Convex hull
Degree (graph theory)
Computational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On the Bounds of Conway's Thrackles
A thrackle on a surface X is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once… (More)
  • figure 2
Is this relevant?
2014
2014
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
It is shown that for a constant t ∈ N, every simple topological graph on n vertices has O(n) edges if the graph has no two sets… (More)
Is this relevant?
2011
2011
Conway's Conjecture for Monotone Thrackles
A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Tangled Thrackles
A tangle is a graph drawn in the plane so that any pair of edges have precisely one point in common, and this point is either an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
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… (More)
  • figure 1
  • figure 3
Is this relevant?
2006
2006
A Reduction 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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The Thrackle Conjecture for K5 and K3,3
We prove the thrackle conjecture for K5 and K3,3. To do this we reduce the problem to a set of simultaneous quadratic equations… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 5
Is this relevant?
2000
2000
Bounds for Generalized Thrackles
A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp. an odd… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
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… (More)
Is this relevant?