DODanielle O'Donnol
Danielle O'Donnol
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Danielle O'Donnol has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Dorothy Buck
Department of Mathematical Sciences, University of Bath, Bath, UK
1 shared publication - Elena Pavelescu
Mathematics and Statistics Department, University of South Alabama, Mobile, AL, United States
1 shared publication - Peter Lambert-Cole1 shared publication
Latest Publications
- Open Access
Unknotting numbers for prime $θ$-curves up to seven crossings
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding of a planar graph $G$, then we show $u(g) \geq \max\{u(s) |$ $s$ is a non-overlapping set of constituents of $g\}$. Focusing on $\theta$-curves, we determine the exact unknotting numbers of the $\theta$-curves in the Litherland-Moriuchi Table. Additionally, we demonstrate unknotting crossing changes for all of the curves. In doing this we introduce new methods for obstructing unknotting number $1$ in $\theta$-curves.Open AccessUnknotting numbers for prime $θ$-curves up to seven crossings
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding of a planar graph $G$, then we show $u(g) \geq \max\{u(s) |$ $s$ is a non-overlapping set of constituents of $g\}$. Focusing on $\theta$-curves, we determine the exact unknotting numbers of the $\theta$-curves in the Litherland-Moriuchi Table. Additionally, we demonstrate unknotting crossing changes for all of the curves. In doing this we introduce new methods for obstructing unknotting number $1$ in $\theta$-curves. - Open Access
- 20 August 2016
- Published by Springer Nature
- p. 117-137
The Total Thurston–Bennequin Number of Complete and Complete Bipartite Legendrian Graphs
- 20 August 2016
- Published by Springer Nature
- p. 117-137
Open AccessThe Total Thurston–Bennequin Number of Complete and Complete Bipartite Legendrian Graphs
- Open Access
Planar Legendrian graphs
We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique trivial embedding of $G$ is Legendrian simple.Open AccessPlanar Legendrian graphs
We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique trivial embedding of $G$ is Legendrian simple.