A computational approach to Conway's thrackle conjecture

DOI10.1007/978-3-642-18469-7_21MaRDI QIDQ3073675zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Radoslav Fulek, János Pach

Publication date 11 February 2011

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18469-7_21

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• A computational approach to Conway's thrackle conjecture
• COMPUTATIONAL GEOMETRY COLUMN 26
• On Conway's thrackle conjecture
• A new upper bound for Conway's thrackles
• On the bounds of Conway's thrackles

Cited in

(4)

• The Design of the Sixth Answer Set Programming Competition
• On Conway's thrackle conjecture
• COMPUTATIONAL GEOMETRY COLUMN 26
• A computational approach to Conway's thrackle conjecture

This page was built for publication: A computational approach to Conway's thrackle conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073675)