Matches in DBpedia 2014 for { ?s ?p 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 common endpoint, or, if they have no endpoints in common, at a point in their interiors. In the latter case, the crossing must be transverse.. }
Showing items 1 to 2 of
2
with 100 items per page.
- Conway's_thrackle_conjecture abstract "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 common endpoint, or, if they have no endpoints in common, at a point in their interiors. In the latter case, the crossing must be transverse.".
- Conway's_thrackle_conjecture comment "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 common endpoint, or, if they have no endpoints in common, at a point in their interiors. In the latter case, the crossing must be transverse.".