Tangled thrackles
DOI10.1007/978-3-642-34191-5_4zbMATH Open1374.68355OpenAlexW4233090249MaRDI QIDQ4899263FDOQ4899263
Authors: János Pach, Radoš Radoičić, Géza Tóth 
Publication date: 7 January 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34191-5_4
Recommendations
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)
Cites Work
- On Conway's thrackle conjecture
- The largest small hexagon
- Some geometric applications of Dilworth's theorem
- Tangencies between families of disjoint regions in the plane
- On grids in topological graphs
- Conway's conjecture for monotone thrackles
- A computational approach to Conway's thrackle conjecture
- Disjoint edges in topological graphs
- Generalized thrackle drawings of non-bipartite graphs
- Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
- Subthrackleable graphs and four-cycles
- Bounds for generalized thrackles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Outerplanar thrackles
- Note on geometric graphs
- Crossings between curves with many tangencies
Cited In (7)
This page was built for publication: Tangled thrackles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899263)
