Mark N. Ellingham

49 papers Journal 49

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