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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
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
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
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
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 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 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 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
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
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
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?