Mark N. Ellingham
Affiliations: | Vanderbilt University, Nashville, TN |
Area:
MathematicsWebsite:
https://as.vanderbilt.edu/math/bio/?who=mark-ellinghamGoogle:
"Mark N. Ellingham"Children
Sign in to add traineeDana L. Jennings | grad student | 2003 | Vanderbilt |
D. Christopher Stephens | grad student | 2004 | Vanderbilt |
Daniel P. Biebighauser | grad student | 2006 | Vanderbilt |
Justin Z. Schroeder | grad student | 2012 | Vanderbilt |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Ellingham MN, Nowbandegani PS. (2020) The Chvátal–Erdős condition for prism-Hamiltonicity Discrete Mathematics. 343: 111709 |
Ellingham MN, Nowbandegani PS, Shan S. (2020) Toughness and prism-hamiltonicity of P4-free graphs Discrete Applied Mathematics. 284: 201-206 |
Ellingham MN, Ellis-Monaghan JA. (2019) Edge-outer graph embedding and the complexity of the DNA reporter strand problem Theoretical Computer Science. 785: 117-127 |
Liu W, Lawrencenko S, Chen B, et al. (2019) Quadrangular embeddings of complete graphs and the Even Map Color Theorem Journal of Combinatorial Theory, Series B. 139: 1-26 |
Ellingham MN, Marshall EA, Ozeki K, et al. (2019) Hamiltonicity of planar graphs with a forbidden minor Journal of Graph Theory. 90: 459-483 |
Biebighauser DP, Ellingham MN. (2018) One‐way infinite 2‐walks in planar graphs Journal of Graph Theory. 88: 110-130 |
Chen G, Ellingham MN, Saito A, et al. (2017) Spanning Trails with Maximum Degree at Most 4 in $$2K_2$$-Free Graphs Graphs and Combinatorics. 33: 1095-1101 |
Ellingham MN, Marshall EA, Ozeki K, et al. (2016) A characterization of K |
Ellingham MN, Marshall EA. (2015) Criticality of Counterexamples to Toroidal Edge-Hamiltonicity Graphs and Combinatorics |
Ellingham MN, Schroeder JZ. (2014) Orientable hamilton cycle embeddings of complete tripartite graphs II: Voltage graph constructions and applications Journal of Graph Theory. 77: 219-236 |