| Bar k-Visibility Graphs. AM Dean, WS Evans, E Gethner, JD Laison, MA Safari, WT Trotter J. Graph Algorithms Appl. 11 (1), 45-59, 2007 | 70 | 2007 |
| A stroll through the Gaussian primes E Gethner, S Wagon, B Wick The American mathematical monthly 105 (4), 327-337, 1998 | 51 | 1998 |
| Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics A Brodsky, S Durocher, E Gethner Discrete Mathematics 262 (1-3), 59-77, 2003 | 40 | 2003 |
| The Rectilinear Crossing Number of K_10 is 62 A Brodsky, S Durocher, E Gethner arXiv preprint cs/0009023, 2000 | 37 | 2000 |
| On crossing numbers of complete tripartite and balanced complete multipartite graphs E Gethner, L Hogben, B Lidický, F Pfender, A Ruiz, M Young Journal of Graph Theory 84 (4), 552-565, 2017 | 30 | 2017 |
| Periodic Gaussian moats E Gethner, HM Stark Experimental Mathematics 6 (4), 289-292, 1997 | 21 | 1997 |
| How false is Kempe’s proof of the Four Color Theorem? Part II E Gethner, B Kallichanda, AS Mentis, S Braudrick, S Chawla, A Clune, ... Involve 2 (3), 249-266, 2009 | 18 | 2009 |
| Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs DL Boutin, E Gethner, T Sulanke Journal of Graph Theory 57 (3), 198-214, 2008 | 17 | 2008 |
| List-distinguishing colorings of graphs M Ferrara, B Flesch, E Gethner the electronic journal of combinatorics, P161-P161, 2011 | 16 | 2011 |
| Unit bar-visibility layouts of triangulated polygons AM Dean, E Gethner, JP Hutchinson Graph Drawing: 12th International Symposium, GD 2004, New York, NY, USA …, 2005 | 16 | 2005 |
| Thickness-two graphs part two: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs E Gethner, T Sulanke Graphs and Combinatorics 25, 197-217, 2009 | 15 | 2009 |
| The thickness and chromatic number of r-inflated graphs MO Albertson, DL Boutin, E Gethner Discrete mathematics 310 (20), 2725-2734, 2010 | 14 | 2010 |
| Thickness and colorability of geometric graphs S Durocher, E Gethner, D Mondal Computational Geometry 56, 1-18, 2016 | 13 | 2016 |
| Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness AM Dean, W Evans, E Gethner, JD Laison, MA Safari, WT Trotter Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland …, 2006 | 12 | 2006 |
| List distinguishing parameters of trees M Ferrara, E Gethner, SG Hartke, D Stolee, PS Wenger Discrete Applied Mathematics 161 (6), 864-869, 2013 | 10 | 2013 |
| More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. MO Albertson, DL Boutin, E Gethner Ars Math. Contemp. 4 (1), 5-24, 2011 | 8 | 2011 |
| On a generalization of a combinatorial problem posed by MC Escher E Gethner Congressus Numerantium, 77-96, 2001 | 8 | 2001 |
| To the moon and beyond E Gethner Graph Theory: Favorite Conjectures and Open Problems-2, 115-133, 2018 | 7 | 2018 |
| are not Hecke Eigenfunctions E Gethner A Tribute to Emil Grosswald: Number Theory and Related Analysis: Number …, 1993 | 7 | 1993 |
| Extending precolorings to distinguish group actions M Ferrara, E Gethner, SG Hartke, D Stolee, PS Wenger European Journal of Combinatorics 72, 12-28, 2018 | 6 | 2018 |
