Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2016

2016

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… Expand

Is this relevant?

2011

2011

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… Expand

Is this relevant?

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… Expand

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… Expand

Is this relevant?

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… Expand

Is this relevant?

2006

2006

A system for ensuring that the transmitted pulse of a coherent ladar is at the correct frequency for coherent detection of… Expand

Is this relevant?

2004

2004

We prove the thrackle conjecture for K5 and K3,3. To do this we reduce the problem to a set of simultaneous quadratic equations… Expand

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… Expand

Is this relevant?

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… Expand

Is this relevant?

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… Expand

Is this relevant?