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)

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

2017

2017

- Luis A. Goddyn, Yian Xu
- Discrete & Computational Geometry
- 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)

Is this relevant?

2014

2014

- Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. TÃ³th
- Graph Drawing
- 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

- JÃ¡nos Pach, Ethan Sterling
- The American Mathematical Monthly
- 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)

Is this relevant?

2011

2011

- JÃ¡nos Pach, Rados Radoicic, GÃ©za TÃ³th
- EGC
- 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)

Is this relevant?

2010

2010

- Radoslav Fulek, JÃ¡nos Pach
- Graph Drawing
- 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)

Is this relevant?

2006

2006

- Wei Li, Karen Daniels, Konstantin A. Rybnikov
- CCCG
- 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)

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)

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)

Is this relevant?

2000

2000

- Grant Cairns, Yury Nikolayevsky
- Discrete & Computational Geometry
- 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)

Is this relevant?

1995

1995

- LÃ¡szlÃ³ LovÃ¡sz, JÃ¡nos Pach, Mario Szegedy
- Symposium on Computational Geometry
- 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?