Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,703,768 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a…

2011

2011

Abstract A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common…

2009

2009

A graph drawing is called a generalized thrackle if every pair of edges meets an odd number of times. In a previous paper, we…

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…

Highly Cited

2000

Highly Cited

2000

Abstract. A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp…

1997

1997

Abstract. A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs…

Highly Cited

1995

Highly Cited

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…