Mark N. Ellingham

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 13

Top Topics

Graph Theoretical

Manifold Learning

Structured Objects

Top Venues

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Mark N. Ellingham, Linyuan Lu, Zhiyu Wang
Maximum spectral radius of outerplanar 3-uniform hypergraphs. J. Graph Theory 100 (4) (2022)
Wenzhong Liu, Mark N. Ellingham, Dong Ye
Minimal quadrangulations of surfaces. J. Comb. Theory, Ser. B 157 (2022)
Mark N. Ellingham, Joanna A. Ellis-Monaghan
A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries. Symmetry 14 (9) (2022)
Mark N. Ellingham, Songling Shan, Dong Ye, Xiaoya Zha
-minor-free graphs. J. Graph Theory 96 (3) (2021)
Mark N. Ellingham, Pouria Salehi Nowbandegani
The Chvátal-Erdős condition for prism-Hamiltonicity. Discret. Math. 343 (7) (2020)
Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan
Toughness and prism-hamiltonicity of P4-free graphs. Discret. Appl. Math. 284 (2020)
Mark N. Ellingham, Emily A. Marshall, Kenta Ozeki, Shoichi Tsuchiya
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90 (4) (2019)
Mark N. Ellingham, Joanna A. Ellis-Monaghan
Edge-outer graph embedding and the complexity of the DNA reporter strand problem. Theor. Comput. Sci. 785 (2019)
Wenzhong Liu, Serge Lawrencenko, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. J. Comb. Theory, Ser. B 139 (2019)
Daniel P. Biebighauser, Mark N. Ellingham
One-way infinite 2-walks in planar graphs. J. Graph Theory 88 (1) (2018)
Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan
-Free Graphs. Graphs Comb. 33 (5) (2017)
Mark N. Ellingham, Emily A. Marshall, Kenta Ozeki, Shoichi Tsuchiya
-Minor-Free Graphs. SIAM J. Discret. Math. 30 (2) (2016)
Mark N. Ellingham, Emily A. Marshall
Criticality of Counterexamples to Toroidal Edge-Hamiltonicity. Graphs Comb. 32 (1) (2016)
Mark N. Ellingham, Justin Z. Schroeder
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications. J. Graph Theory 77 (3) (2014)
Mark N. Ellingham, Michael D. Plummer, Gexin Yu
Linkage for the diamond and the path with four vertices. J. Graph Theory 70 (3) (2012)
Mark N. Ellingham, Justin Z. Schroeder
Nonorientable hamilton cycle embeddings of complete tripartite graphs. Discret. Math. 312 (11) (2012)
Mark N. Ellingham, Xiaoya Zha
Orientable embeddings and orientable cycle double covers of projective-planar graphs. Eur. J. Comb. 32 (4) (2011)
Mark N. Ellingham, Justin Z. Schroeder
Distinguishing partitions and asymmetric uniform hypergraphs. Ars Math. Contemp. 4 (1) (2011)
Mark N. Ellingham, D. Christopher Stephens
The orientable genus of some joins of complete graphs with large edgeless graphs. Discret. Math. 309 (5) (2009)
Daniel P. Biebighauser, Mark N. Ellingham
Prism-hamiltonicity of triangulations. J. Graph Theory 57 (3) (2008)
Mark N. Ellingham, Adam Weaver
. Electron. Notes Discret. Math. 31 (2008)
Mark N. Ellingham, Ken-ichi Kawarabayashi
2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory, Ser. B 97 (3) (2007)
Mark N. Ellingham, D. Christopher Stephens
The nonorientable genus of joins of complete graphs with large edgeless graphs. J. Comb. Theory, Ser. B 97 (5) (2007)
Mark N. Ellingham, Chris Stephens, Xiaoya Zha
The nonorientable genus of complete tripartite graphs. J. Comb. Theory, Ser. B 96 (4) (2006)
Mark N. Ellingham, Chris Stephens, Xiaoya Zha
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs. Eur. J. Comb. 26 (3-4) (2005)
Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20 (4) (2004)
Mark N. Ellingham, Xiaoya Zha, Yi Zhang
Spanning 2-trails from degree sum conditions. J. Graph Theory 45 (4) (2004)
Mark N. Ellingham, Xiaoya Zha
Separating Cycles in Doubly Toroidal Embeddings. Graphs Comb. 19 (2) (2003)
Rommel M. Barbosa, Mark N. Ellingham
A characterisation of cubic parity graphs. Australas. J Comb. 28 (2003)
Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss
)-factors. J. Graph Theory 39 (1) (2002)
Mark N. Ellingham, Xiaoya Zha
The Spectral Radius of Graphs on Surfaces. J. Comb. Theory, Ser. B 78 (1) (2000)
Mark N. Ellingham, Xiaoya Zha
Toughness, trees, and walks. J. Graph Theory 33 (3) (2000)
Mark N. Ellingham, D. K. Menser
Girth, minimum degree, and circumference. J. Graph Theory 34 (3) (2000)
Yair Caro, Mark N. Ellingham, J. E. Ramey
Local Structure When All Maximal Independent Sets Have Equal Weight. SIAM J. Discret. Math. 11 (4) (1998)
Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton
Cycles in quasi 4-connected graphs. Australas. J Comb. 15 (1997)
Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen
-isomorphisms for graphs. J. Graph Theory 26 (1) (1997)
Mark N. Ellingham
Vertex-Switching Reconstruction and Folded Cubes. J. Comb. Theory, Ser. B 66 (2) (1996)
Mark N. Ellingham, Luis A. Goddyn
List Edge Colourings of Some 1-Factorable Multigraphs. Comb. 16 (3) (1996)
Richard Brunet, Mark N. Ellingham, Zhicheng Gao, Alice Metzlar, R. Bruce Richter
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle. J. Comb. Theory, Ser. B 65 (1) (1995)
Mark N. Ellingham, Zhicheng Gao
Spanning Trees in Locally Planar Triangulations. J. Comb. Theory, Ser. B 61 (2) (1994)
Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson
Contractible edges in longest cycles in non-Hamiltonian graphs. Discret. Math. 133 (1-3) (1994)
Mark N. Ellingham
Basic subgraphs and graph spectra. Australas. J Comb. 8 (1993)
Mark N. Ellingham, Gordon F. Royle
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. J. Comb. Theory, Ser. B 54 (2) (1992)
Mark N. Ellingham
Vertex-switching, isomorphism, and pseudosimilarity. J. Graph Theory 15 (6) (1991)
Mark N. Ellingham
Isomorphic factorization of r-regular graphs into r parts. Discret. Math. 69 (1) (1988)
Mark N. Ellingham, László Pyber, Xingxing Yu
Claw-free graphs are edge reconstructible. J. Graph Theory 12 (3) (1988)
Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman
Bidegreed graphs are edge reconstructible. J. Graph Theory 11 (3) (1987)
Mark N. Ellingham, Derek A. Holton, Charles H. C. Little
Cycles through ten vertices in 3-connected cubic graphs. Comb. 4 (4) (1984)
Mark N. Ellingham, Joseph Douglas Horton
Non-hamiltonian 3-connected cubic bipartite graphs. J. Comb. Theory, Ser. B 34 (3) (1983)