Mark N. Ellingham

Orcid: 0000-0002-3995-7200

Affiliations:
  • Vanderbilt University, Department of Mathematics, Nashville, USA


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Maximum spectral radius of outerplanar 3-uniform hypergraphs.
J. Graph Theory, 2022

Minimal quadrangulations of surfaces.
J. Comb. Theory B, 2022

2021
Toughness and spanning trees in K<sub>4</sub>-minor-free graphs.
J. Graph Theory, 2021

2020
The Chvátal-Erdős condition for prism-Hamiltonicity.
Discret. Math., 2020

Toughness and prism-hamiltonicity of P4-free graphs.
Discret. Appl. Math., 2020

2019
Edge-outer graph embedding and the complexity of the DNA reporter strand problem.
Theor. Comput. Sci., 2019

Hamiltonicity of planar graphs with a forbidden minor.
J. Graph Theory, 2019

Quadrangular embeddings of complete graphs and the Even Map Color Theorem.
J. Comb. Theory B, 2019

2018
One-way infinite 2-walks in planar graphs.
J. Graph Theory, 2018

2017
Spanning Trails with Maximum Degree at Most 4 in 2K<sub>2</sub> -Free Graphs.
Graphs Comb., 2017

2016
A Characterization of K<sub>2, 4</sub>-Minor-Free Graphs.
SIAM J. Discret. Math., 2016

Criticality of Counterexamples to Toroidal Edge-Hamiltonicity.
Graphs Comb., 2016

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

2012
Linkage for the diamond and the path with four vertices.
J. Graph Theory, 2012

Nonorientable hamilton cycle embeddings of complete tripartite graphs.
Discret. Math., 2012

2011
Orientable embeddings and orientable cycle double covers of projective-planar graphs.
Eur. J. Comb., 2011

Distinguishing partitions and asymmetric uniform hypergraphs.
Ars Math. Contemp., 2011

2009
The orientable genus of some joins of complete graphs with large edgeless graphs.
Discret. Math., 2009

2008
Prism-hamiltonicity of triangulations.
J. Graph Theory, 2008

Constructing all minimum genus embeddings of K<sub>3, n</sub>.
Electron. Notes Discret. Math., 2008

2007
The nonorientable genus of joins of complete graphs with large edgeless graphs.
J. Comb. Theory B, 2007

2-Connected spanning subgraphs with low maximum degree in locally planar graphs.
J. Comb. Theory B, 2007

2006
The nonorientable genus of complete tripartite graphs.
J. Comb. Theory B, 2006

2005
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs.
Eur. J. Comb., 2005

2004
Spanning 2-trails from degree sum conditions.
J. Graph Theory, 2004

Colorability of Planar Graphs with Isolated Nontriangular Faces.
Graphs Comb., 2004

2003
Separating Cycles in Doubly Toroidal Embeddings.
Graphs Comb., 2003

A characterisation of cubic parity graphs.
Australas. J Comb., 2003

2002
Connected (<i>g, f</i>)-factors.
J. Graph Theory, 2002

2000
Toughness, trees, and walks.
J. Graph Theory, 2000

Girth, minimum degree, and circumference.
J. Graph Theory, 2000

The Spectral Radius of Graphs on Surfaces.
J. Comb. Theory B, 2000

1998
Local Structure When All Maximal Independent Sets Have Equal Weight.
SIAM J. Discret. Math., 1998

1997
<i>P</i><sub>3</sub>-isomorphisms for graphs.
J. Graph Theory, 1997

Cycles in quasi 4-connected graphs.
Australas. J Comb., 1997

1996
Vertex-Switching Reconstruction and Folded Cubes.
J. Comb. Theory B, 1996

List Edge Colourings of Some 1-Factorable Multigraphs.
Comb., 1996

1995
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle.
J. Comb. Theory B, 1995

1994
Spanning Trees in Locally Planar Triangulations.
J. Comb. Theory B, 1994

Contractible edges in longest cycles in non-Hamiltonian graphs.
Discret. Math., 1994

1993
Basic subgraphs and graph spectra.
Australas. J Comb., 1993

1992
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.
J. Comb. Theory B, 1992

1991
Vertex-switching, isomorphism, and pseudosimilarity.
J. Graph Theory, 1991

1988
Claw-free graphs are edge reconstructible.
J. Graph Theory, 1988

Isomorphic factorization of r-regular graphs into r parts.
Discret. Math., 1988

1987
Bidegreed graphs are edge reconstructible.
J. Graph Theory, 1987

1984
Cycles through ten vertices in 3-connected cubic graphs.
Comb., 1984

1983
Non-hamiltonian 3-connected cubic bipartite graphs.
J. Comb. Theory B, 1983


  Loading...