Mark N. Ellingham

According to our database, Mark N. Ellingham authored at least 49 papers between 1983 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries.

Mark N. Ellingham, Joanna A. Ellis-Monaghan

Symmetry, 2022

Maximum spectral radius of outerplanar 3-uniform hypergraphs.

Mark N. Ellingham, Linyuan Lu, Zhiyu Wang

J. Graph Theory, 2022

Minimal quadrangulations of surfaces.

Wenzhong Liu, Mark N. Ellingham, Dong Ye

J. Comb. Theory, Ser. B, 2022

2021

Toughness and spanning trees in K₄-minor-free graphs.

Mark N. Ellingham, Songling Shan, Dong Ye, Xiaoya Zha

J. Graph Theory, 2021

2020

The Chvátal-Erdős condition for prism-Hamiltonicity.

Mark N. Ellingham, Pouria Salehi Nowbandegani

Discret. Math., 2020

Toughness and prism-hamiltonicity of P4-free graphs.

Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan

Discret. Appl. Math., 2020

2019

Edge-outer graph embedding and the complexity of the DNA reporter strand problem.

Mark N. Ellingham, Joanna A. Ellis-Monaghan

Theor. Comput. Sci., 2019

Hamiltonicity of planar graphs with a forbidden minor.

Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya

J. Graph Theory, 2019

Quadrangular embeddings of complete graphs and the Even Map Color Theorem.

Wenzhong Liu, Serge Lawrencenko, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha

J. Comb. Theory, Ser. B, 2019

2018

One-way infinite 2-walks in planar graphs.

Daniel P. Biebighauser, Mark N. Ellingham

J. Graph Theory, 2018

2017

Spanning Trails with Maximum Degree at Most 4 in 2K₂ -Free Graphs.

Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan

Graphs Comb., 2017

2016

A Characterization of K_{2, 4}-Minor-Free Graphs.

Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya

SIAM J. Discret. Math., 2016

Criticality of Counterexamples to Toroidal Edge-Hamiltonicity.

Mark N. Ellingham, Emily Abernethy Marshall

Graphs Comb., 2016

2014

Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications.

Mark N. Ellingham, Justin Z. Schroeder

J. Graph Theory, 2014

2012

Linkage for the diamond and the path with four vertices.

Mark N. Ellingham, Michael D. Plummer, Gexin Yu

J. Graph Theory, 2012

Nonorientable hamilton cycle embeddings of complete tripartite graphs.

Mark N. Ellingham, Justin Z. Schroeder

Discret. Math., 2012

2011

Orientable embeddings and orientable cycle double covers of projective-planar graphs.

Mark N. Ellingham, Xiaoya Zha

Eur. J. Comb., 2011

Distinguishing partitions and asymmetric uniform hypergraphs.

Mark N. Ellingham, Justin Z. Schroeder

Ars Math. Contemp., 2011

2009

The orientable genus of some joins of complete graphs with large edgeless graphs.

Mark N. Ellingham, D. Christopher Stephens

Discret. Math., 2009

2008

Prism-hamiltonicity of triangulations.

Daniel P. Biebighauser, Mark N. Ellingham

J. Graph Theory, 2008

Constructing all minimum genus embeddings of K_{3, n}.

Mark N. Ellingham, Adam Weaver

Electron. Notes Discret. Math., 2008

2007

The nonorientable genus of joins of complete graphs with large edgeless graphs.

Mark N. Ellingham, D. Christopher Stephens

J. Comb. Theory, Ser. B, 2007

2-Connected spanning subgraphs with low maximum degree in locally planar graphs.

Mark N. Ellingham, Ken-ichi Kawarabayashi

J. Comb. Theory, Ser. B, 2007

2006

The nonorientable genus of complete tripartite graphs.

Mark N. Ellingham, Chris Stephens, Xiaoya Zha

J. Comb. Theory, Ser. B, 2006

2005

Counterexamples to the nonorientable genus conjecture for complete tripartite graphs.

Mark N. Ellingham, Chris Stephens, Xiaoya Zha

Eur. J. Comb., 2005

2004

Spanning 2-trails from degree sum conditions.

Mark N. Ellingham, Xiaoya Zha, Yi Zhang

J. Graph Theory, 2004

Colorability of Planar Graphs with Isolated Nontriangular Faces.

Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger

Graphs Comb., 2004

2003

Separating Cycles in Doubly Toroidal Embeddings.

Mark N. Ellingham, Xiaoya Zha

Graphs Comb., 2003

A characterisation of cubic parity graphs.

Rommel M. Barbosa, Mark N. Ellingham

Australas. J Comb., 2003

2002

Connected (<i>g, f</i>)-factors.

Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss

J. Graph Theory, 2002

2000

Toughness, trees, and walks.

Mark N. Ellingham, Xiaoya Zha

J. Graph Theory, 2000

Girth, minimum degree, and circumference.

Mark N. Ellingham, D. K. Menser

J. Graph Theory, 2000

The Spectral Radius of Graphs on Surfaces.

Mark N. Ellingham, Xiaoya Zha

J. Comb. Theory, Ser. B, 2000

1998

Local Structure When All Maximal Independent Sets Have Equal Weight.

Yair Caro, Mark N. Ellingham, J. E. Ramey

SIAM J. Discret. Math., 1998

1997

<i>P</i>₃-isomorphisms for graphs.

Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen

J. Graph Theory, 1997

Cycles in quasi 4-connected graphs.

Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton

Australas. J Comb., 1997

1996

Vertex-Switching Reconstruction and Folded Cubes.

Mark N. Ellingham

J. Comb. Theory, Ser. B, 1996

List Edge Colourings of Some 1-Factorable Multigraphs.

Mark N. Ellingham, Luis A. Goddyn

Comb., 1996

1995

Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle.

Richard Brunet, Mark N. Ellingham, Zhicheng Gao, Alice Metzlar, R. Bruce Richter

J. Comb. Theory, Ser. B, 1995

1994

Spanning Trees in Locally Planar Triangulations.

Mark N. Ellingham, Zhicheng Gao

J. Comb. Theory, Ser. B, 1994

Contractible edges in longest cycles in non-Hamiltonian graphs.

Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson

Discret. Math., 1994

1993

Basic subgraphs and graph spectra.

Mark N. Ellingham

Australas. J Comb., 1993

1992

Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.

Mark N. Ellingham, Gordon F. Royle

J. Comb. Theory, Ser. B, 1992

1991

Vertex-switching, isomorphism, and pseudosimilarity.

Mark N. Ellingham

J. Graph Theory, 1991

1988

Claw-free graphs are edge reconstructible.

Mark N. Ellingham, László Pyber, Xingxing Yu

J. Graph Theory, 1988

Isomorphic factorization of r-regular graphs into r parts.

Mark N. Ellingham

Discret. Math., 1988

1987

Bidegreed graphs are edge reconstructible.

Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman

J. Graph Theory, 1987

1984

Cycles through ten vertices in 3-connected cubic graphs.

Mark N. Ellingham, Derek A. Holton, Charles H. C. Little

Comb., 1984

1983

Non-hamiltonian 3-connected cubic bipartite graphs.

Mark N. Ellingham, Joseph Douglas Horton

J. Comb. Theory, Ser. B, 1983