Graphs and Combinatorics

, Volume 28, Issue 1, pp 85–96 | Cite as

Outerplanar Thrackles

Original Paper


We show that a graph drawing is an outerplanar thrackle if and only if, up to an inversion in the plane, it is Reidemeister equivalent to an odd musquash. This establishes Conway’s thrackle conjecture for outerplanar thrackles. We also extend this result in two directions. First, we show that no pair of vertices of an outerplanar thrackle can be joined by an edge in such a way that the resulting graph drawing is a thrackle. Secondly, we introduce the notion of crossing rank; drawings with crossing rank 0 are generalizations of outerplanar drawings. We show that all thrackles of crossing rank 0 are outerplanar. We also introduce the notion of an alternating cycle drawing, and we show that a thrackled cycle is alternating if and only if it is outerplanar.


Graph drawing Thrackle Outerplanar Alternating cycle Crossing rank 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angenent S.: Parabolic equations for curves on surfaces. I. Curves with p-integrable curvature. Ann. Math. (2) 132(3), 451–483 (1990)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Angenent S.: Parabolic equations for curves on surfaces. II. Intersections, blow-up and generalized solutions. Ann. Math. (2) 133(1), 171–215 (1991)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Cairns G., Elton D.M.: The planarity problem for signed Gauss words. J. Knot Theory Ramif. 2(4), 359–367 (1993)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Cairns G., Elton D.M.: The planarity problem. II. J. Knot Theory Ramif. 5(2), 137–144 (1996)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Cairns G., King D.M.: The answer to Woodall’s musquash problem. Discret. Math. 207(1–3), 25–32 (1999)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Cairns G., King D.M.: All odd musquashes are standard. Discret. Math. 226(1–3), 71–91 (2001)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Cairns, G., McIntyre, M., Nikolayevsky, Y.: The thrackle conjecture for K 5 and K 3,3. In: Towards a Theory of Geometric Graphs. Contemp. Math. vol. 342, pp. 35–54. American Mathematical Society, Providence, RI (2004)Google Scholar
  8. 8.
    Cairns G., Nikolayevsky Y.: Bounds for generalized thrackles. Discret. Comput. Geom. 23(2), 191–206 (2000)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Cairns G., Nikolayevsky Y.: Generalized thrackle drawings of non-bipartite graphs. Discret. Comput. Geom. 41(1), 119–134 (2009)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Chou K.-S., Zhu X.-P.: The Curve Shortening Problem. Chapman & Hall/CRC Press, Boca Raton (2001)CrossRefMATHGoogle Scholar
  11. 11.
    Grünbaum, B.: Arrangements and spreads. In: Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, vol. 10. American Mathematical Society, Providence, RI (1972)Google Scholar
  12. 12.
    Huisken G.: A distance comparison principle for evolving curves. Asian J. Math. 2(1), 127–133 (1998)MATHMathSciNetGoogle Scholar
  13. 13.
    Lovász L., Pach J., Szegedy M.: On Conway’s thrackle conjecture. Discret. Comput. Geom. 18(4), 369–376 (1997)CrossRefMATHGoogle Scholar
  14. 14.
    Pach, J.: Geometric graph theory. In: Surveys in combinatorics, 1999 (Canterbury), London Math. Soc. Lecture Note Ser., vol. 267, pp. 167–200. Cambridge University Press Cambridge (1999)Google Scholar
  15. 15.
    Pach, J., Agarwal Pankaj, K.: Combinatorial geometry. In: Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1995)Google Scholar
  16. 16.
    Woodall, D.R.: Thrackles and deadlock. In: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), pp. 335–347. Academic Press, London (1971)Google Scholar

Copyright information

© Springer 2011

Authors and Affiliations

  1. 1.Department of MathematicsLa Trobe UniversityMelbourneAustralia

Personalised recommendations