Author of the publication

Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem).

, , , and . Australas. J Comb., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Decay of Crossing Numbers of Sparse Graphs., , and . J. Graph Theory, 80 (3): 226-251 (2015)Approximating the Crossing Number of Toroidal Graphs., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 148-159. Springer, (2007)The Crossing Number of a Projective Graph is Quadratic in the Face-Width., , , and . Electr. J. Comb., (2008)On the Number of Unknot Diagrams., , and . SIAM J. Discret. Math., 33 (1): 306-326 (2019)An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn., , , , and . J. Comb. Theory A, 115 (7): 1257-1264 (2008)The maximum number of halving lines and the rectilinear crossing number of Kn for n., , , and . Electron. Notes Discret. Math., (2008)On the length of longest alternating paths for multicoloured point sets in convex position., , and . Discret. Math., 306 (15): 1791-1797 (2006)On the Crossing Number of Almost Planar Graphs., and . GD, volume 4372 of Lecture Notes in Computer Science, page 162-173. Springer, (2006)Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks., , , , , , and . SIROCCO, volume 3104 of Lecture Notes in Computer Science, page 23-34. Springer, (2004)Zarankiewicz's Conjecture is finite for each fixed m., , and . J. Comb. Theory B, 103 (2): 237-247 (2013)