Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Mark N. Ellingham - MaRDI portal

Mark N. Ellingham

From MaRDI portal
(Redirected from Person:251508)
Person:704850

Available identifiers

zbMath Open ellingham.mark-nDBLP01/6005WikidataQ19519582 ScholiaQ19519582MaRDI QIDQ704850

List of research outcomes





PublicationDate of PublicationType
Maximum spectral radius of outerplanar 3‐uniform hypergraphs2023-10-05Paper
Toughness and spanning trees in K4‐minor‐free graphs2023-09-29Paper
Minimal quadrangulations of surfaces2022-09-23Paper
A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings Under Symmetries2022-06-18Paper
https://portal.mardi4nfdi.de/entity/Q33834682021-09-23Paper
Toughness and prism-Hamiltonicity of \(P_4\)-free graphs2020-07-07Paper
The Chvátal-Erdős condition for prism-Hamiltonicity2020-05-21Paper
Quadrangular embeddings of complete graphs and the even map color theorem2019-11-21Paper
Edge-outer graph embedding and the complexity of the DNA reporter strand problem2019-07-31Paper
Hamiltonicity of planar graphs with a forbidden minor2019-04-25Paper
One‐way infinite 2‐walks in planar graphs2018-07-13Paper
Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs2017-12-12Paper
Partial duality and closed 2-cell embeddings2017-07-25Paper
A Characterization of $K_{2,4}$-Minor-Free Graphs2016-05-26Paper
Criticality of counterexamples to toroidal edge-Hamiltonicity2016-03-02Paper
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications2014-11-17Paper
Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications2014-11-17Paper
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions2014-04-04Paper
Constructing all minimum genus embeddings of2013-06-28Paper
Linkage for the diamond and the path with four vertices2012-07-10Paper
Nonorientable Hamilton cycle embeddings of complete tripartite graphs2012-06-18Paper
Distinguishing partitions and asymmetric uniform hypergraphs2012-03-07Paper
Orientable embeddings and orientable cycle double covers of projective-planar graphs2011-04-08Paper
The orientable genus of some joins of complete graphs with large edgeless graphs2009-04-09Paper
Prism‐hamiltonicity of triangulations2008-03-20Paper
The nonorientable genus of joins of complete graphs with large edgeless graphs2007-08-20Paper
2-connected spanning subgraphs with low maximum degree in locally planar graphs2007-04-16Paper
The nonorientable genus of complete tripartite graphs2006-07-12Paper
Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices2005-09-22Paper
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs2005-03-08Paper
Colorability of planar graphs with isolated nontriangular faces2005-01-20Paper
Spanning 2‐trails from degree sum conditions2004-03-29Paper
Separating cycles in doubly toroidal embeddings2003-08-18Paper
https://portal.mardi4nfdi.de/entity/Q44329492003-01-01Paper
Connected (g, f)-factors2002-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45007092001-11-28Paper
Toughness, trees, and walks2000-12-13Paper
The spectral radius of graphs on surfaces2000-06-25Paper
Local Structure When All Maximal Independent Sets Have Equal Weight1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q43906021998-08-31Paper
P3-isomorphisms for graphs1998-03-08Paper
https://portal.mardi4nfdi.de/entity/Q43496101997-12-17Paper
List edge colourings of some 1-factorable multigraphs1997-04-13Paper
Vertex-switching reconstruction and folded cubes1996-11-25Paper
Spanning planar subgraphs of graphs in the torus and Klein bottle1996-05-13Paper
Spanning trees in locally planar triangulations1994-12-01Paper
Contractible edges in longest cycles in non-Hamiltonian graphs1994-11-03Paper
https://portal.mardi4nfdi.de/entity/Q42860761994-06-22Paper
https://portal.mardi4nfdi.de/entity/Q42015851993-08-25Paper
Vertex-switching, isomorphism, and pseudosimilarity1992-06-27Paper
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs1992-01-01Paper
Isomorphic factorization of r-regular graphs into r parts1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183571988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38266081988-01-01Paper
Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs1988-01-01Paper
Bidegreed graphs are edge reconstructible1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206171986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433211986-01-01Paper
Cycles through ten vertices in 3-connected cubic graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32228781984-01-01Paper
Non-Hamiltonian 3-connected cubic bipartite graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30431871983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39490821982-01-01Paper
Bi-eulerian embeddings of graphs and digraphsN/APaper

Research outcomes over time

This page was built for person: Mark N. Ellingham