Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,703,768 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
11 relations
Computational geometry
Convex hull
Degree (graph theory)
Graph (discrete mathematics)
Expand
Broader (1)
Topological graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Annular and pants thrackles
Grace Misereh
,
Y. Nikolayevsky
Discret. Math. Theor. Comput. Sci.
2018
Corpus ID: 49597159
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a…
Expand
2011
2011
Conway's Conjecture for Monotone Thrackles
J. Pach
,
E. Sterling
Am. Math. Mon.
2011
Corpus ID: 17558559
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…
Expand
2009
2009
Generalized Thrackle Drawings of Non-bipartite Graphs
G. Cairns
,
Y. Nikolayevsky
Discret. Comput. Geom.
2009
Corpus ID: 44494930
A graph drawing is called a generalized thrackle if every pair of edges meets an odd number of times. In a previous paper, we…
Expand
2009
2009
Removing even crossings on surfaces
M. J. Pelsmajer
,
M. Schaefer
,
Daniel Stefankovic
Eur. J. Comb.
2009
Corpus ID: 27925062
2007
2007
Removing Even Crossings on Surfaces
M. J. Pelsmajer
,
M. Schaefer
,
Daniel Stefankovic
Electron. Notes Discret. Math.
2007
Corpus ID: 2667382
2006
2006
A Study of Conway's Thrackle Conjecture
Wei Li
,
Karen L. Daniels
,
K. Rybnikov
CCCG
2006
Corpus ID: 8547675
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…
Expand
Highly Cited
2000
Highly Cited
2000
Bounds for Generalized Thrackles
G. Cairns
,
Y. Nikolayevsky
Discret. Comput. Geom.
2000
Corpus ID: 16099892
Abstract. A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp…
Expand
1999
1999
The answer to Woodall's musquash problem
G. Cairns
,
Deborah M. King
Discret. Math.
1999
Corpus ID: 14171066
1997
1997
On Conway's Thrackle Conjecture
L. Lovász
,
J. Pach
,
M. Szegedy
1997
Corpus ID: 34236334
Abstract. A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs…
Expand
Highly Cited
1995
Highly Cited
1995
On Conway's thrackle conjecture
L. Lovász
,
J. Pach
,
M. Szegedy
SCG '95
1995
Corpus ID: 2365537
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE